collaborators

1 paper

math.NT2026

A New Sparse Algorithm for Polynomial GCD over Integers

Qiao-Long Huang, Michael Monagan

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 s…