On Euclid's Algorithm and the Theory of Subresultants

@article{Brown1971OnEA,
  title={On Euclid's Algorithm and the Theory of Subresultants},
  author={W. S. Brown and J. Traub},
  journal={J. ACM},
  year={1971},
  volume={18},
  pages={505-514}
}
Abstract : A key ingredient for systems which perform symbolic computer manipulation of multivariate rational functions are efficient algorithms for calculating polynomial greatest common divisors. Euclid's algorithm cannot be used directly because of problems with coefficient growth. The search for better methods leads naturally to the theory of subresultants. This paper presents an elementary treatment of the theory of subresultants, and examines the relationship of the subresultants of a… Expand
266 Citations
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
  • 146
  • PDF
The Subresultant PRS Algorithm
  • 66
  • PDF
Optimizations of the subresultant algorithm
  • 49
On the subresultant PRS algorithm
  • 29
The EZ GCD algorithm
  • J. Moses, D. Yun
  • Mathematics, Computer Science
  • ACM Annual Conference
  • 1973
  • 83
Algorithme de Bareiss, algorithme des sous-résultants
  • L. Ducos
  • Mathematics, Computer Science
  • RAIRO Theor. Informatics Appl.
  • 1996
  • 10
  • PDF
...
1
2
3
4
5
...