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

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

1 2 3 next

  1. Genitrini, Antoine; Pépin, Martin; Peschanski, Frédéric: A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space (2022)
  2. Andrejić, Vladica; Bostan, Alin; Tatarevic, Milos: Improved algorithms for left factorial residues (2021)
  3. Berthomieu, Christian Eder, Mohab Safey El Din: msolve: A Library for Solving Polynomial Systems (2021) arXiv
  4. David Avis, Charles Jordan: lrsarith: a small fixed/hybrid arithmetic C library (2021) arXiv
  5. Doliskani, Javad; Narayanan, Anand Kumar; Schost, Éric: Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (2021)
  6. Doris, Christopher: Exact (p)-adic computation in Magma (2021)
  7. Hare, Kevin G.; Jankauskas, Jonas: On Newman and Littlewood polynomials with a prescribed number of zeros inside the unit disk (2021)
  8. Hemelsoet, Nicolas; Voorhaar, Rik: A computer algorithm for the BGG resolution (2021)
  9. Ryan, Nathan C.; Scherr, Zachary; Sirolli, Nicolás; Treneer, Stephanie: Congruences satisfied by eta-quotients (2021)
  10. Brini, Andrea: Exterior powers of the adjoint representation and the Weyl ring of (E_8) (2020)
  11. Costa, Edgar; Elsenhans, Andreas-Stephan; Jahnel, Jörg: On the distribution of the Picard ranks of the reductions of a (K3) surface (2020)
  12. Kangas, Kustaa; Koivisto, Mikko; Salonen, Sami: A faster tree-decomposition based algorithm for counting linear extensions (2020)
  13. Mathieu-Mahias, Axel; Quisquater, Michaël: Fast multipoint evaluation and interpolation of polynomials in the LCH-basis over (\mathbbF_P^r) (2020)
  14. Neiger, Vincent; Rosenkilde, Johan; Solomatov, Grigory: Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation (2020)
  15. 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)
  16. Brieulle, Ludovic; De Feo, Luca; Doliskani, Javad; Flori, Jean-Pierre; Schost, Éric: Computing isomorphisms and embeddings of finite fields (2019)
  17. Bromberger, Martin; Fleury, Mathias; Schwarz, Simon; Weidenbach, Christoph: SPASS-SATT. A CDCL(LA) solver (2019)
  18. De Feo, Luca; Randriam, Hugues; Rousseau, Édouard: Standard lattices of compatibly embedded finite fields (2019)
  19. Hyun, Seung Gyu; Neiger, Vincent; Schost, Éric: Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants (2019)
  20. Kangas, Kustaa; Koivisto, Mikko; Salonen, Sami: A faster tree-decomposition based algorithm for counting linear extensions (2019)

1 2 3 next