Fast Library for Number Theory

The Fast Library for Number Theory (FLINT) is a highly optimized C library for number theory applications. The two major areas of functionality currently implemented in FLINT are polynomial arithmetic over the integers and 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 Warwick and David Harvey of Harvard University to address the speed limitations of the Pari and NTL libraries.[1]

References

1. ^ Page 10 of the Project Description for UW 2006 COMPMATH Proposal 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
* Video of the talk Algebraic Number Theory with FLINT (November 11, 2007) by William Hart

Number Theory