Metraipolis › archive › dc_6ba11eaf4ec6
Fast Library for Number Theory — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Fast_Library_for_Number_Theory
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T18:48:29.484Z
- SHA-256 of the archived text
3cff5e1e6dbdc87eb6acb5ffa61bab9d587681bc15f34696f12be02f356b0976- Stable URL of this page
https://metraipolis.com/documento/dc_6ba11eaf4ec6
How to cite
Fast Library for Number Theory — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Fast_Library_for_Number_Theory (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_6ba11eaf4ec6 (Metraipolis archive dc_6ba11eaf4ec6, sha256 3cff5e1e6dbdc87eb6acb5ffa61bab9d587681bc15f34696f12be02f356b0976)
BibTeX
@misc{dc6ba11eaf4ec6,
title = {Fast Library for Number Theory — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Fast_Library_for_Number_Theory},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_6ba11eaf4ec6; sha256 3cff5e1e6dbdc87eb6acb5ffa61bab9d587681bc15f34696f12be02f356b0976},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Fast_Library_for_Number_Theory. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Fast Library for Number Theory (FLINT) is a C library for number theory applications. It implements efficient versions of various ring arithmetics as well as derived functionality such as integer factorization using a quadratic sieve. The library is designed to be compiled with the GNU Multi-Precision Library (GMP) and is released under the GNU General Public License. It is developed by William Hart of the University of Kaiserslautern (formerly University of Warwick) and David Harvey of University of New South Wales (formerly Harvard University) to address the speed limitations of the PARI and NTL libraries. FLINT along with a Cython wrapper for it is distributed with SageMath. The development of FLINT has led to significant contributions in the areas of integer factorization and polynomial arithmetic. For example as of May, 2007 on certain platforms FLINT factors integers in the quadratic sieve range faster than any other general implementation, and as of February, 2008 it does arithmetic in Z [ x ] {\displaystyle \mathbb {Z} [x]} faster than any other package.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «number theory»).
Fonte: Wikipedia in inglese, voce «Fast Library for Number Theory» — https://en.wikipedia.org/wiki/Fast_Library_for_Number_Theory
Wikidata Q5436959 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5436959
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Fast_Library_for_Number_Theory?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1333188776, consultata il 2026-10-15T18:09:36.138Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 8eddf9a2104e508177575091901e3a8394ecd75bb3bfaf19e4c2f83acd2003ce