A New Sparse Algorithm for Polynomial GCD over Integers
Qiao-Long Huang, Michael Monagan
Source abstract
We describe a new greatest common divisor (GCD) algorithm for polynomials with integer coefficients. The bit complexity of the new algorithm is polynomial in the input and output sizes and the individual degree bounds.Our algorithm follows the standard approach by reducing multivariate polynomial GCD to univariate polynomial GCD. Our algorithm reduces a multivariate polynomial GCD to a single univariate polynomial GCD. The main idea of our algorithm is a new variable substitution which reduces a multivariate polynomial to a separated one, that is, the coefficients in a main variable are all monomials. The explicit bit complexity is analyzed and we have implemented our algorithm in Maple. It is shown that our algorithm is efficient for polynomials with high degree, large number of variables, but small number of terms in GCD.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.