FLINT

Fast library for number theory: an introduction. We discuss FLINT (Fast Library for Number Theory), a library to support computations in number theory, including highly optimised routines for polynomial arithmetic and linear algebra in exact rings.

This software is also referenced in ORMS.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 19 articles , 1 standard article )

Showing results 1 to 19 of 19.
Sorted by year (citations)

  1. Claus Fieker, William Hart, Tommy Hofmann, Fredrik Johansson: Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming Language (2017) arXiv
  2. Dubickas, Artūras; Hare, Kevin G.; Jankauskas, Jonas: No two non-real conjugates of a Pisot number have the same imaginary part (2017)
  3. Janko Boehm, Wolfram Decker, Simon Keicher, Yue Ren: Current Challenges in Developing Open Source Computer Algebra Systems (2017) arXiv
  4. Aguilar-Melchor, Carlos; Barrier, Joris; Guelton, Serge; Guinet, Adrien; Killijian, Marc-Olivier; Lepoint, Tancrède: NFLlib: NTT-based fast lattice library (2016)
  5. Böhm, Janko; Decker, Wolfram; Keicher, Simon; Ren, Yue: Current challenges in developing open source computer algebra systems (2016)
  6. Groves, A.Whitman; Roche, Daniel S.: Sparse polynomials in FLINT (2016)
  7. Grenet, Bruno; van der Hoeven, Joris; Lecerf, Grégoire: Randomized root finding over finite FFT-fields using tangent Graeffe transforms (2015)
  8. Johansson, Fredrik: Rigorous high-precision computation of the Hurwitz zeta function and its derivatives (2015)
  9. Pancratz, Sebastian; Tuitman, Jan: Improvements to the deformation method for counting points on smooth projective hypersurfaces (2015)
  10. Alcázar, Juan Gerardo; Hermoso, Carlos; Muntingh, Georg: Detecting similarity of rational plane curves (2014)
  11. Coates, John H.; Dokchitser, Tim; Liang, Zhibin; Stein, William; Sujatha, R.: Non-commutative Iwasawa theory for modular forms (2013)
  12. Ghitza, Alexandru; Mcandrew, Angus: Experimental evidence for Maeda’s conjecture on modular forms (2012)
  13. Johansson, Fredrik: Efficient implementation of the Hardy-Ramanujan-Rademacher formula (2012)
  14. Berthomieu, Jérémy; van der Hoeven, Joris; Lecerf, Grégoire: Relaxed algorithms for $p$-adic numbers (2011)
  15. Hart, William; Novocin, Andrew: Practical divide-and-conquer algorithms for polynomial arithmetic (2011)
  16. Eröcal, Burçin; Stein, William: The Sage project: unifying free mathematical software to create a viable alternative to Magma, Maple, Mathematica and Matlab (2010)
  17. Fukuda, Komei (ed.); van der Hoeven, Joris (ed.); Joswig, Michael (ed.); Takayama, Nobuki (ed.): Mathematical software -- ICMS 2010. Third international congress on mathematical software, Kobe, Japan, September 13--17, 2010. Proceedings (2010)
  18. Hart, William B.: Fast library for number theory: an introduction (2010)
  19. Harvey, David: A cache-friendly truncated FFT (2009)