Fast Library for Number Theory
| FLINT | |
|---|---|
| Developer(s) | William Hart and David Harvey |
| Stable release | 1.0.9
/ March 11, 2008 |
| Repository | |
| Written in | C |
| Operating system | POSIX systems |
| Type | Mathematical software |
| License | GNU General Public License |
| Website | flintlib.org |
The Fast Library for Number Theory (FLINT) is a highly optimized C library for number theory applications. The main areas of functionality currently available in FLINT are integer factorization, polynomial arithmetic, and integer multiplication. The library is built with the GNU Multi-Precision Library and is released under the GNU General Public License. It is developed by William Hart of the University of Warwick and David Harvey of Harvard University to address the speed limitations of the Pari and NTL libraries.[1]
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[2], and as of February, 2008 it does arithmetic in faster than any other package.[3]
![{\displaystyle \mathbb {Z} [x]}](/media/api/rest_v1/media/math/render/svg/0d4da3ac703cc7721ebba91a53f6752de7157124)
References
- ^ Page 10 of the Project Description for UW 2006 COMPMATH Proposal by William Stein
- ^ Bottom of page 11 of Abstract of Talks, Illinois Number Theory Fest 2007
- ^ Slide 25 of the talk Numbers in Sage (February 29, 2008) by William Stein
- FLINT 1.0.9: Fast Library for Number Theory by William Hart and David Harvey
- Video of the talk Parallel Computation in Number Theory (January 30,2007) by William Hart
- Video of the talk FLINT and Fast Polynomial Arithmetic (June 13, 2007) By David Harvey
- Video of the talk A short talk on short division (October 1, 2007) by William Hart
- Pages 2 and 6–9 of William Hart's grant proposal Algorithms for Algebraic Number Theory