On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- 1 October 1971
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 18 (4), 478-504
- https://doi.org/10.1145/321662.321664
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- On Euclid's Algorithm and the Theory of SubresultantsJournal of the ACM, 1971
- The calculation of multivariate polynomial resultantsPublished by Association for Computing Machinery (ACM) ,1971
- Bigradients and the Problem of Routh and HurwitzSIAM Review, 1968
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967
- Proceedings of the ACM Symposium on Symbolic and Algebraic ManipulationCommunications of the ACM, 1966
- ASYMPTOTIC EXPANSIONSPublished by Defense Technical Information Center (DTIC) ,1955