Fast Library for Number Theory: An Introduction
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3939412
- Fast Multipliers for Number Theoretic Transforms
- scientific article; zbMATH DE number 802334
- Numerical Algorithms for Number Theory
- scientific article; zbMATH DE number 3932301
- Faster arithmetic for number-theoretic transforms
- A computational introduction to number theory and algebra
- scientific article; zbMATH DE number 2204782
- scientific article; zbMATH DE number 918133
- Faster algorithms for Frobenius numbers
Cited in
(28)- FLINT
- Algorithms for the construction of high-order Kronrod rule extensions with application to sparse-grid integration
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
- New constructions of hinting PRGs, OWFs with encryption, and more
- An efficient subsumption test pipeline for BS(LRA) clauses
- Detecting similarity of rational plane curves
- Exterior powers of the adjoint representation and the Weyl ring of \(E_8\)
- Planar master integrals for four-loop form factors
- Records on the vanishing of Fourier coefficients of powers of the Dedekind eta function
- Rigorous high-precision computation of the Hurwitz zeta function and its derivatives
- Reconstructing rational functions with \texttt{FireFly}
- Sato-Tate distributions
- On the evaluation of some sparse polynomials
- Computing isomorphisms and embeddings of finite fields
- A faster tree-decomposition based algorithm for counting linear extensions
- On Newman and Littlewood polynomials with a prescribed number of zeros inside the unit disk
- Computing level one Hecke eigensystems (mod )
- A fast algorithm for reversion of power series
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- 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}
- Algorithmic counting of nonequivalent compact Huffman codes
- msolve. A library for solving polynomial systems
- Calcium. Computing in exact real and complex fields
- Algorithm 1050: SPEX Cholesky, LDL, and backslash for exactly solving sparse linear systems
- A faster tree-decomposition based algorithm for counting linear extensions
This page was built for publication: Fast Library for Number Theory: An Introduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747866)
