Sparse polynomial interpolation: faster strategies over finite fields
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3759547 (Why is no real title available?)
- scientific article; zbMATH DE number 1262424 (Why is no real title available?)
- scientific article; zbMATH DE number 2151179 (Why is no real title available?)
- scientific article; zbMATH DE number 871950 (Why is no real title available?)
- A New Algorithm for Factoring Polynomials Over Finite Fields
- A fast parallel sparse polynomial GCD algorithm
- A partial Bombieri-Vinogradov theorem with explicit constants
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Dagwood
- Deterministic root finding over finite fields using Graeffe transforms
- Diversification improves interpolation
- Early termination in sparse interpolation algorithms
- Essentially optimal sparse polynomial multiplication
- Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis
- Explicit bounds for primes in arithmetic progressions
- Fast computation of GCDs
- Fast multiplication of polynomials over fields of characteristic 2
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs
- Faster polynomial multiplication over finite fields
- Faster sparse multivariate polynomial interpolation of straight-line programs
- Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
- Interpolation of polynomials given by straight-line programs
- Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation
- Multivariate sparse interpolation using randomized Kronecker substitutions
- On the bit-complexity of sparse polynomial and series multiplication
- PRIMES is in P
- Polynomial multiplication over finite fields in time O(n n)
- Randomized root finding over finite FFT-fields using tangent Graeffe transforms
- Some inequalities relating to the partial sum of binomial probabilities
- Sparse interpolation over finite fields via low-order roots of unity
- Sparse polynomial interpolation and division in soft-linear time
- Sparse polynomial interpolation over fields with large or zero characteristic
- Sparse polynomial interpolation with finitely many values for the coefficients
- Structured FFT and TFT: symmetric and lattice polynomials
- Testing polynomials
- The Frobenius FFT
- The complexity of partial derivatives
- The difference between consecutive primes. II
- Tutorial on large deviations for the binomial distribution
- What can (and can't) we do with sparse polynomials?
This page was built for publication: Sparse polynomial interpolation: faster strategies over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6898875)
