Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
Name: libflint14 | Distribution: SUSE Linux Enterprise 15 SP3 |
Version: 3.0~7794 | Vendor: openSUSE |
Release: bp153.1.1 | Build date: Sat Feb 20 18:19:19 2021 |
Group: System/Libraries | Build host: armbuild13 |
Size: 5759518 | Source RPM: flint-3.0~7794-bp153.1.1.src.rpm |
Packager: https://bugs.opensuse.org | |
Url: http://flintlib.org/ | |
Summary: C library for doing number theory |
FLINT (Fast Library for Number Theory) is a C library in support of computations in number theory. It is also a research project into algorithms in number theory. At this stage, FLINT consists mainly of fast integer and polynomial arithmetic and linear algebra.
LGPL-2.1-or-later
* Sat Aug 29 2020 Jan Engelhardt <jengelh@inai.de> - Update to version 2.6.3 [boo#1169283] * New features: * Multivariate polynomials over most standard rings (sparse distributed) * APR-CL primality proving * Elliptic Curve integer factoring * Pollard rho integer factoring * p+1 integer factoring * Best of Breed smooth & general integer factoring routine * Howell and Strong Echelon form * Möller–Granlund precomputed inverses * Fibonacci polynomials * sqrt of series and polynomials * Division of series over Z * Shifted Legendre polynomials, Laguerre polynomials, Gegenbauer polys. * Threading of FFT for integer and polynomial multiplication over Z; threading of quadratic sieve for integer factoring; threading for multivariate polynomial multiplication, division and GCD; threaded multiplication of matrices mod p. * For more, see the NEWS file in the flint-devel subpackage. - Marked as 3.0~7781 (git rev-list --count 0e8613b3336f356e07f7bbd4bb2ae5eded68ca40..v2.6.3) for Leap 15.2 since downgrades of the Version field are not easily possible. - Enable integration with libntl - Drop 0001-build-provide-autotools-files.patch * Sun May 28 2017 bwiedemann@suse.com - Sort input files to make build reproducible (boo#1041090) * Sun Nov 13 2016 jengelh@inai.de - Adjust 0001-build-provide-autotools-files.patch for new NTL-10.x header file names. * Sun Mar 13 2016 jengelh@inai.de - Update to git snapshot of the master branch [marked as 3.0~ in openSUSE due to lack of any prospect on what the version will be] * Add implementation of Moller-Granlund invert_limb * Add implementations of n_div2_preinv and n_divrem2_preinv. * Add primitive flint exception mechanism. * Add n_powmod2_ui_preinv * Add exception for impossible inverse to n_invmod and remove resulting exceptions throughout Flint. * Remove smooth factorisation since it is completely broken. - Remove 0002-compile-fixes.diff * Sat Nov 14 2015 jengelh@inai.de - Update to new upstream release 2.5.2 * LLL (rational, Nguyen-Stehle, from Gram matrix, with_removal, Storjohann/ULLL) * Hermite normal form (naive, xgcd, Domich-Kannan-Trotter, Kannan-Bachem, Pernet-Stein) * Smith normal form (diagonal, Kannen-Bachem, Iliopoulos) * Paterson-Stockmeyer algorithm * modular resultant; hgcd resultant; polynomial discriminant * multithreaded multimodular Taylor shift * multithreaded Brent-Kung composition * multithreaded Kaltofen-Shoup distinct degree factorisation * multiplication based reduced row echelon form * place inline functions in library for foreign function interfaces * Primality tests for large integers (Pocklington, Morrison) * Probable prime tests for large integers (Lucas, Baillie-PSW, strong-psp, Brillhart-Lehmer-Selfridge) * CRT for large integers * Dixon algorithm for nullspace * Brent-Kung composition in irreducibility and distinct degree factorisation * floating point QR decomposition * Schwarz-Rutishauser Gram-Schmidt algorithm * Ogita-Rump-Oishi dot product * Bodrato matrix squaring * matrix concatenation functions * additional functions for returning factor of modulus in polys over Z/nZ * Hadamard matrix construction * series addition/subtraction * teach flint_printf/sprintf about explicit width format specifiers * Fri Jun 26 2015 jengelh@inai.de - Update to new upstream release 2.4.5 * fixed a severe bug in flint's fmpz_poly_gcd_heuristic * Thu Feb 19 2015 jengelh@inai.de - Add 0002-compile-fixes.diff to fend off improper usage of NTL headers. * Mon Oct 20 2014 schwab@suse.de - Don't use unknown option -mno-popcnt * Sun Aug 10 2014 jengelh@inai.de - Update to new upstream release 2.4.4 * Fix a bug in the ARM assembly * Fri Feb 07 2014 jengelh@inai.de - Update to new upstream release 2.4.1 * C++ expressions template wrapper * Fast factorisation of polynomials over Z/nZ * improved p-adics * polynomials/matrices over p-adics * qadics * Finite fields (small and large F_q), polynomials/matrices over F_q * Finite fields with Zech logarithm representation * Fast factorisation of polynomials over F_q * Faster Brent-Kung modular composition * New prime sieving code * Lambert-W function * Precomputed inverses for polynomials and large integers * Williams' P+1 integer factoring algorithm * Harvey's KS2/KS4 polynomial multiplication * Faster primality testing up to 64 bits * Support for GMP * Support for Boehm-Demers-Weiser GC * Support for flint extension modules
/usr/lib/libflint.so.14 /usr/lib/libflint.so.14.0.3 /usr/share/licenses/libflint14 /usr/share/licenses/libflint14/LICENSE
Generated by rpm2html 1.8.1
Fabrice Bellet, Sun Jun 9 15:26:24 2024