Fast Library for Number Theory: An Introduction
From MaRDI portal
Publication:5747866
DOI10.1007/978-3-642-15582-6_18zbMath1273.11177OpenAlexW1557168674MaRDI QIDQ5747866
Publication date: 14 September 2010
Published in: Mathematical Software – ICMS 2010 (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/41629/1/WRAP_Hart_0584144-ma-270913-flint-extended-abstract.pdf
Related Items
Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization, Algorithms for the construction of high-order Kronrod rule extensions with application to sparse-grid integration, Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric, Exact hierarchical reductions of dynamical models via linear transformations, Fast norm computation in smooth-degree abelian number fields, Interpolation of dense and sparse rational functions and other improvements in \texttt{FireFly}, On the evaluation of some sparse polynomials, Reconstructing rational functions with \texttt{FireFly}, Computing isomorphisms and embeddings of finite fields, Sato-Tate distributions, On Newman and Littlewood polynomials with a prescribed number of zeros inside the unit disk, A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions, Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields, Detecting similarity of rational plane curves, Computing level one Hecke eigensystems (mod ), Exterior powers of the adjoint representation and the Weyl ring of \(E_8\), FLINT, Planar master integrals for four-loop form factors, Records on the vanishing of Fourier coefficients of powers of the Dedekind eta function, A fast algorithm for reversion of power series, A faster tree-decomposition based algorithm for counting linear extensions, New constructions of hinting PRGs, OWFs with encryption, and more, An efficient subsumption test pipeline for BS(LRA) clauses, Rigorous high-precision computation of the Hurwitz zeta function and its derivatives
Uses Software
