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 32 articles , 1 standard article )

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

1 2 next

  1. Belkić, Dževad: All the trinomial roots, their powers and logarithms from the Lambert series, Bell polynomials and Fox-Wright function: illustration for genome multiplicity in survival of irradiated cells (2019)
  2. Brieulle, Ludovic; De Feo, Luca; Doliskani, Javad; Flori, Jean-Pierre; Schost, Éric: Computing isomorphisms and embeddings of finite fields (2019)
  3. Asadi, Mohammadali; Brandt, Alexander; Moir, Robert H. C.; Moreno Maza, Marc: Sparse polynomial arithmetic with the BPAS library (2018)
  4. Haque, S. Anisul; Li, X.; Mansouri, F.; Moreno Maza, M.; Mohajerani, D.; Pan, W.: \bfCUMODP: a CUDA library for modular polynomial computation (2018)
  5. Nogneng, Dorian; Schost, Éric: On the evaluation of some sparse polynomials (2018)
  6. Bourquin, Raoul: Algorithms for the construction of high-order Kronrod rule extensions with application to sparse-grid integration (2017)
  7. Claus Fieker, William Hart, Tommy Hofmann, Fredrik Johansson: Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming Language (2017) arXiv
  8. Dubickas, Artūras; Hare, Kevin G.; Jankauskas, Jonas: No two non-real conjugates of a Pisot number have the same imaginary part (2017)
  9. Foissy, Loïc; Fromentin, Jean: A divisibility result in combinatorics of generalized braids (2017)
  10. Janko Boehm, Wolfram Decker, Simon Keicher, Yue Ren: Current Challenges in Developing Open Source Computer Algebra Systems (2017) arXiv
  11. Stanislav Poslavsky: Rings: an efficient Java/Scala library for polynomial rings (2017) arXiv
  12. Aguilar-Melchor, Carlos; Barrier, Joris; Guelton, Serge; Guinet, Adrien; Killijian, Marc-Olivier; Lepoint, Tancrède: NFLlib: NTT-based fast lattice library (2016)
  13. Bangay, Shaun; Beliakov, Gleb: On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics. (2016)
  14. Böhm, Janko; Decker, Wolfram; Keicher, Simon; Ren, Yue: Current challenges in developing open source computer algebra systems (2016)
  15. Chen, Changbo; Covanov, Svyatoslav; Mansouri, Farnam; Moir, Robert H. C.; Maza, Marc Moreno; Xie, Ning; Xie, Yuzhen: The basic polynomial algebra subprograms (2016)
  16. Groves, A. Whitman; Roche, Daniel S.: Sparse polynomials in FLINT (2016)
  17. Mosunov, A. S.; Jacobson, M. J. jun.: Unconditional class group tabulation of imaginary quadratic fields to $\vert \Delta\vert < 2^40$ (2016)
  18. Grenet, Bruno; van der Hoeven, Joris; Lecerf, Grégoire: Randomized root finding over finite FFT-fields using tangent Graeffe transforms (2015)
  19. Johansson, Fredrik: Rigorous high-precision computation of the Hurwitz zeta function and its derivatives (2015)
  20. Johansson, Fredrik: A fast algorithm for reversion of power series (2015)

1 2 next