scientific article; zbMATH DE number 871950

zbMATH Open0845.65004MaRDI QIDQ4875225FDOQ4875225

Ashwin Rao, Ming-Deh A. Huang

Publication date: 23 September 1996

Title of this publication is not available (Why is that?)

Recommendations

• Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
• Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
• Sparse polynomial interpolation based on diversification
• Sparse interpolation over finite fields via low-order roots of unity

zbMATH Keywords

interpolationfinite fieldsparallel algorithmsgcdsparse multivariate polynomialspolynomial-factorization

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Numerical interpolation (65D05) Finite fields (field-theoretic aspects) (12E20) Polynomials in general fields (irreducibility, etc.) (12E05)

Cited In (8)

• \(\varepsilon\)-discrepancy sets and their application for interpolation of sparse polynomials
• Computing sparse GCD of multivariate polynomials via polynomial interpolation
• An improved EZ-GCD algorithm for multivariate polynomials
• Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields
• Noisy interpolation of sparse polynomials in finite fields
• Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
• Fast interpolation of multivariate polynomials with sparse exponents
• Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields

This page was built for publication:

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