flint 2.8.2-1 source package in Ubuntu
Changelog
flint (2.8.2-1) unstable; urgency=medium [ John Scott ] * Add a DEP-8 test exercising some functionality of FLINT. [ Julien Puydt ] * New upstream release. -- Julien Puydt <email address hidden> Sat, 16 Oct 2021 13:10:37 +0200
Upload details
- Uploaded by:
- Debian Science Maintainers
- Uploaded to:
- Sid
- Original maintainer:
- Debian Science Maintainers
- Architectures:
- any all
- Section:
- libs
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| flint_2.8.2-1.dsc | 2.2 KiB | 799d60a8f4d82408e3b28ec7644f2860cd6eb43501871bd8f32539570de0e14b |
| flint_2.8.2.orig.tar.gz | 5.0 MiB | af1bb934e24b8fddcb06f92bab8c0adef49ab2a883c2b0b1f70dd2a9c871bf6c |
| flint_2.8.2-1.debian.tar.xz | 8.7 KiB | 9d6cdab93789c2591505de98f7dc0e0ede4acd3d97df83a44ade2b0215a67e79 |
Available diffs
- diff from 2.8.1-1 to 2.8.2-1 (2.4 KiB)
No changes file available.
Binary packages built by this source
- libflint-2.8.2: No summary available for libflint-2.8.2 in ubuntu jammy.
No description available for libflint-2.8.2 in ubuntu jammy.
- libflint-2.8.2-dbgsym: No summary available for libflint-2.8.2-dbgsym in ubuntu jammy.
No description available for libflint-
2.8.2-dbgsym in ubuntu jammy.
- libflint-dev: C library for number theory, development files
The Fast Library for Integer Number Theory is a C library which supports
polynomial arithmetic over the integers, fast integer arithmetic and factoring
(including a highly optimized quadratic sieve).
.
FLINT has functionality similar to that of the Number Theory Library (NTL).
However, unlike NTL, which is designed primarily for asymptotic performance,
FLINT is designed for good performance in small cases as well.
.
This package contains the FLINT development files.
- libflint-doc: Documentation for the FLINT library
The Fast Library for Integer Number Theory is a C library which supports
polynomial arithmetic over the integers, fast integer arithmetic and factoring
(including a highly optimized quadratic sieve).
.
FLINT has functionality similar to that of the Number Theory Library (NTL).
However, unlike NTL, which is designed primarily for asymptotic performance,
FLINT is designed for good performance in small cases as well.
.
This package contains the FLINT documentation
