Sparse polynomial interpolation over fields with large or zero characteristic

DOI10.1145/3326229.3326250MaRDI QIDQ5121110zbMATH OpenOpenAlexWikidataFDO

Authors Qiao-Long Huang

Publication date 10 September 2020

Published in Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3326229.3326250

zbMATH Keywords

derivativerandomized Kronecker substitutionsparse polynomial interpolationstraight-line program

Mathematics Subject Classification ID

Computational methods for problems pertaining to field theory (12-08) Interpolation in approximation theory (41A05) Numerical interpolation (65D05) Randomized algorithms (68W20)

Recommendations

• Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs
• Sparse interpolation over finite fields via low-order roots of unity
• Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
• Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
• A new deterministic algorithm for sparse multivariate polynomial interpolation

Cited in

(16)

• Interpolation of polynomials given by straight-line programs
• Sparse polynomial interpolation with finitely many values for the coefficients
• Sparse polynomial interpolation based on derivatives
• Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs
• Sparse polynomial interpolation in Chebyshev bases
• Noisy interpolation of sparse polynomials in finite fields
• Sparse interpolation over finite fields via low-order roots of unity
• Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields
• Faster sparse interpolation of straight-line programs
• Fast interpolation of multivariate polynomials with sparse exponents
• Sparse multiplication of multivariate linear differential operators
• On exact division and divisibility testing for sparse polynomials
• Sparse polynomial interpolation: faster strategies over finite fields
• Factoring sparse polynomials fast
• Fast interpolation and multiplication of unbalanced polynomials
• Sparse polynomial interpolation with error correction: higher error capacity by randomization

This page was built for publication: Sparse polynomial interpolation over fields with large or zero characteristic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5121110)