Sciweavers

ISSAC
1999
Springer
116views Mathematics» more  ISSAC 1999»
14 years 3 months ago
On the Genericity of the Modular Polynomial GCD Algorithm
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
Erich Kaltofen, Michael B. Monagan