Fast Library for Number Theory

From Wikipedia, the free encyclopedia

FLINT
Developed by	William Hart and David Harvey
Latest release	1.0.9 / March 11, 2008
Written in	C
OS	POSIX systems
Genre	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 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]

Contents 1 Motivation 2 Design Philosophy 2.1 Asymptotically Fast Algorithms 2.2 Implementations Fast as or Faster than Alternatives 2.3 Written in Pure C 2.4 Reliance on GMP 2.5 Extensively Tested 2.6 Extensively Profiled 2.7 Support for Parallel Computation 3 Functionality 3.1 Polynomial Arithmetic over the Integers 3.2 Quadratic Sieve 4 Impact 5 Future Development 6 References

[edit] Motivation

[edit] Design Philosophy

[edit] Asymptotically Fast Algorithms

[edit] Implementations Fast as or Faster than Alternatives

[edit] Written in Pure C

[edit] Reliance on GMP

[edit] Extensively Tested

[edit] Extensively Profiled

[edit] Support for Parallel Computation

[edit] Functionality

[edit] Polynomial Arithmetic over the Integers

[edit] Quadratic Sieve

[edit] Impact

[edit] Future Development

[edit] References