The EZ GCD algorithm

@inproceedings{Moses1973TheEG,
  title={The EZ GCD algorithm},
  author={J. Moses and D. Yun},
  booktitle={ACM Annual Conference},
  year={1973}
}
  • J. Moses, D. Yun
  • Published in ACM Annual Conference 1973
  • Mathematics, Computer Science
This paper presents a preliminary report on a new algorithm for computing the Greatest Common Divisor (GCD) of two multivariate polynomials over the integers. The algorithm is strongly influenced by the method used for factoring multivariate polynomials over the integers. It uses an extension of the Hensel lemma approach originally suggested by Zassenhaus for factoring univariate polynomials over the integers. We point out that the cost of the Modular GCD algorithm applied to sparse… Expand
83 Citations
The EEZ-GCD algorithm
  • P. Wang
  • Mathematics, Computer Science
  • SIGS
  • 1980
  • 39
Factoring larger multivariate polynomials
  • P. Wang
  • Mathematics, Computer Science
  • SIGS
  • 1976
Algorithms for computing greatest common divisors of parametric multivariate polynomials
  • PDF
Complexity of Algorithms for Computing Greatest Common Divisors of Parametric Univariate Polynomials
  • 4
  • PDF
An extended GCD algorithm for parametric univariate polynomials and application to parametric smith normal form
  • PDF
Three New Algorithms for Multivariate Polynomial GCD
  • 19
A New Algorithm for Computing the Extended Hensel Construction of Multivariate Polynomials
  • Highly Influenced
  • PDF
An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
  • 5
  • PDF
Computing polynomial greatest common divisors using sparse interpolation
  • Highly Influenced
  • PDF
...
1
2
3
4
5
...