Fast Library for Number Theory

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
FLINT
Original authorsWilliam Hart, David Harvey, and others
DevelopersFredrik Johansson, Albin Ahlbäck (maintainers), and others
Stable release
3.1.3 / 26 April 2024; 23 months ago (2024-04-26)
Repository
  • {{URL|example.com|optional display text}}Lua error in Module:EditAtWikidata at line 29: attempt to index field 'wikibase' (a nil value).
Written inC
Engine
    Lua error in Module:EditAtWikidata at line 29: attempt to index field 'wikibase' (a nil value).
    Operating systemPOSIX systems
    TypeMathematical software
    LicenseGNU Lesser General Public License
    Websiteflintlib.org

    The Fast Library for Number Theory (FLINT) is a 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 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.[1]

    Design Philosophy

    [edit | edit source]
    • Asymptotically Fast Algorithms
    • Implementations Fast as or Faster than Alternatives
    • Written in Pure C
    • Reliance on GMP
    • Extensively Tested
    • Extensively Profiled
    • Support for Parallel Computation

    Functionality

    [edit | edit source]
    • Polynomial Arithmetic over the Integers
    • Quadratic Sieve

    References

    [edit | edit source]
    1. ^ Page 10 of the Project Description for UW 2006 COMPMATH Proposal by William Stein

    Further reading

    [edit | edit source]
    Retrieved from "http://70.231.62.181/index.php?title=Fast_Library_for_Number_Theory&oldid=2335465"