Sparse polynomial interpolation and division in soft-linear time

DOI10.1145/3476446.3536173MaRDI QIDQ6665785zbMATH OpenFDO

Authors Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche

Publication date 17 January 2025

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

zbMATH Keywords

exact divisionsparse interpolationsparse polynomial arithmetic

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited in

(7)

• A new black box GCD algorithm using Hensel lifting
• 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
• New bounds on quotient polynomials with applications to exact division and divisibility testing of sparse polynomials
• A new bound on cofactors of sparse polynomials

This page was built for publication: Sparse polynomial interpolation and division in soft-linear time

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