Diversification improves interpolation
From MaRDI portal
Recommendations
- Sparse polynomial interpolation based on diversification
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Symbolic-numeric sparse interpolation of multivariate polynomials
- Revisit sparse polynomial interpolation based on randomized Kronecker substitution
- Sparse interpolation over finite fields via low-order roots of unity
Cited in
(14)- Deterministic sparse FFT for M-sparse vectors
- A fast parallel sparse polynomial GCD algorithm
- Sparse polynomial interpolation based on diversification
- Sparse polynomial interpolation based on derivatives
- Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs
- Faster sparse multivariate polynomial interpolation of straight-line programs
- On the evaluation of some sparse polynomials
- On exact division and divisibility testing for sparse polynomials
- Sparse polynomial interpolation: faster strategies over finite fields
- Bit complexity of polynomial GCD on sparse representation
- Factoring sparse polynomials fast
- Fast interpolation and multiplication of unbalanced polynomials
- Practical cryptanalysis of pseudorandom correlation generators based on quasi-abelian syndrome decoding
- An algorithm for implicit interpolation
This page was built for publication: Diversification improves interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5254162)
