Accelerated tower arithmetic
From MaRDI portal
Publication:2338646
Recommendations
- Faster arithmetic for number-theoretic transforms
- Fast arithmetic with general Gauß periods
- Acceleration of the computation of Bernoulli numbers
- Fast arithmetics in Artin-Schreier towers over finite fields
- Fast arithmetics in Artin-Schreier towers over finite fields
- Toward Accurate and Fast Summation
- Accelerated shift-and-add algorithms
- Fast Parallel Arithmetic via Modular Representation
- scientific article; zbMATH DE number 1869997
Cites work
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A Gröbner free alternative for polynomial system solving
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Algebraic numbers: An example of dynamic evaluation
- Associative differential operations
- Computing representations for radicals of finitely generated differential ideals
- Constructing tower extensions of finite fields for implementation of pairing-based cryptography
- Deterministic root finding over finite fields using Graeffe transforms
- Effective procedures in field theory
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Even faster integer multiplication
- Fast algorithms for -adic towers over finite fields
- Fast Algorithms for Manipulating Formal Power Series
- Fast algorithms for zero-dimensional polynomial systems using duality
- Fast arithmetic for triangular sets: from theory to practice
- Fast arithmetics in Artin-Schreier towers over finite fields
- Fast computation of power series solutions of systems of differential equations
- Fast construction of irreducible polynomials over finite fields
- Fast modular transforms
- Fast polynomial factorization and modular composition
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast rectangular matrix multiplication and applications
- Faster integer multiplication using plain vanilla FFT primes
- Faster integer multiplication using short lattice vectors
- Faster polynomial multiplication over finite fields
- Homotopy techniques for multiplication modulo triangular sets
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3539809 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 2151179 (Why is no real title available?)
- Inversion modulo zero-dimensional regular chains
- Modern computer algebra
- Modular composition modulo triangular sets and applications
- Modular composition via factorization
- Numerical methods for roots of polynomials. II
- On fast multiplication of polynomials over arbitrary algebras
- On the bit-complexity of sparse polynomial and series multiplication
- On the complexity of computing with zero-dimensional triangular sets
- On the complexity of multivariate blockwise polynomial multiplication
- On the complexity of the D5 principle
- On the complexity of the Lickteig-Roy subresultant algorithm
- On the factorization of polynomials in a finite number of steps
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- On the theories of triangular sets
- Polynomial root finding over local rings and application to error correcting codes
- Relaxed Hensel lifting of triangular sets
- Sub-cubic change of ordering for Gröbner basis: a probabilistic approach
Cited in
(15)- Accelerated shift-and-add algorithms
- 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
- [[:Publication:2149947|A quasi-linear irreducibility test in \(\mathbb{K}x[y]\)]]
- Computing Riemann-Roch spaces via Puiseux expansions
- Directed evaluation
- On the complexity exponent of polynomial system solving
- Fast algorithms for -adic towers over finite fields
- Univariate polynomial factorization over finite fields with large extension degree
- Fast norm computation in smooth-degree abelian number fields
- Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions
- On the Complexity of Linear Algebra Operations over Algebraic Extension Fields
- Faster modular composition
- Plane curve germs and contact factorization
This page was built for publication: Accelerated tower arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2338646)
