Testing polynomials

DOI10.1016/S0747-7171(08)80033-8MaRDI QIDQ755792zbMATH OpenFDO

Authors Jean-Jacques Risler, Felice Ronga

Publication date 1990

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0747-7171(08)80033-8

zbMATH Keywords

Descartes' lemmasparse polynomialstesting set

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Parallel algorithms in computer science (68W10)

Recommendations

• The complexity of sparse polynomial interpolation over finite fields
• scientific article; zbMATH DE number 2079409
• Binomiality testing and computing sparse polynomials via witness sets
• scientific article; zbMATH DE number 503193
• The interpolation problem for \(k\)-sparse polynomials and character sums

Cites work

• Additive Complexity and Zeros of Real Polynomials

Cited in

(12)

• Testing positiveness of polynomials
• Zero testing of \(p\)-adic and modular polynomials
• Test polynomials
• Tropical combinatorial Nullstellensatz and sparse polynomials
• Efficient algorithms for sparse cyclotomic integer zero testing
• scientific article; zbMATH DE number 1033920 (Why is no real title available?)
• A real Riemann-Hurwitz theorem
• Testing Low Degree Trigonometric Polynomials
• The set of m-th equal partition points of n-simplex and decision of the zero polynomial
• scientific article; zbMATH DE number 2219805 (Why is no real title available?)
• Zero testing and equation solving for sparse polynomials on rectangular domains
• Sparse polynomial interpolation: faster strategies over finite fields

This page was built for publication: Testing polynomials

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