Accelerated tower arithmetic
From MaRDI portal
Publication:2338646
DOI10.1016/j.jco.2019.03.002zbMath1493.68404OpenAlexW2909065051WikidataQ128200029 ScholiaQ128200029MaRDI QIDQ2338646
Joris van der Hoeven, Grégoire Lecerf
Publication date: 21 November 2019
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2019.03.002
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)
Related Items
A quasi-linear irreducibility test in \(\mathbb{K}x[y\)], On the complexity exponent of polynomial system solving, Computing Riemann-Roch spaces via Puiseux expansions, Directed evaluation, Univariate polynomial factorization over finite fields with large extension degree, Fast norm computation in smooth-degree abelian number fields, Computing the equisingularity type of a pseudo-irreducible polynomial, Computing Puiseux series: a fast divide and conquer algorithm, Amortized multi-point evaluation of multivariate polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic root finding over finite fields using Graeffe transforms
- Even faster integer multiplication
- Modular composition modulo triangular sets and applications
- Fast arithmetics in Artin-Schreier towers over finite fields
- Relaxed Hensel lifting of triangular sets
- Homotopy techniques for multiplication modulo triangular sets
- Modular composition via factorization
- Computing representations for radicals of finitely generated differential ideals
- Fast arithmetic for triangular sets: from theory to practice
- On fast multiplication of polynomials over arbitrary algebras
- Fast modular transforms
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Fast rectangular matrix multiplication and applications
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Fast algorithms for zero-dimensional polynomial systems using duality
- On the complexity of the Lickteig-Roy subresultant algorithm
- On the theories of triangular sets
- Algebraic numbers: An example of dynamic evaluation
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- On the complexity of computing with zero-dimensional triangular sets
- On the bit-complexity of sparse polynomial and series multiplication
- Numerical methods for roots of polynomials. II
- Polynomial root finding over local rings and application to error correcting codes
- Associative differential operations
- On the factorization of polynomials in a finite number of steps
- Modern Computer Algebra
- Inversion Modulo Zero-Dimensional Regular Chains
- Fast algorithms for l -adic towers over finite fields
- Faster Polynomial Multiplication over Finite Fields
- Fast Polynomial Factorization and Modular Composition
- Effective procedures in field theory
- Sub-cubic change of ordering for Gröbner basis
- Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast Algorithms for Manipulating Formal Power Series
- Faster integer multiplication using plain vanilla FFT primes
- On the complexity of multivariate blockwise polynomial multiplication
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Fast construction of irreducible polynomials over finite fields
- A Gröbner free alternative for polynomial system solving
- Faster integer multiplication using short lattice vectors
