Computing sparse GCD of multivariate polynomials via polynomial interpolation

DOI10.1007/s11424-017-6332-0OpenAlexW2771644429MaRDI QIDQ1621170

Bingyu Li, Min Tang, Zhenbing Zeng

Publication date: 8 November 2018

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-017-6332-0

zbMATH Keywords

multivariate polynomial interpolationBen-Or/Tiwari algorithmsparse GCDZippel's algorithm

Mathematics Subject Classification ID

Numerical interpolation (65D05)

Uses Software

• GCDHEU

Cites Work

• Sparse interpolation of multivariate rational functions
• Robust estimation of GCD with sparse coefficients
• Gradual sub-lattice reduction and a new complexity for factoring polynomials
• On Hensel factorization. I
• The EEZ-GCD algorithm
• Multivariate Polynomial Factorization
• Factoring Multivariate Polynomials Over the Integers
• Algorithms for polynomial GCD computation over algebraic function fields
• Vector rational number reconstruction
• Algorithms for the non-monic case of the sparse modular GCD algorithm
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On Euclid's Algorithm and the Theory of Subresultants
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing sparse GCD of multivariate polynomials via polynomial interpolation