An improved non-modular polynomial GCD algorithm
- 1 July 1972
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSAM Bulletin
- No. 23,p. 10-15
- https://doi.org/10.1145/1093522.1093524
Abstract
An improved non-modular algorithm for the calculation of the greatest common divisor of two multivariate polynomials is presented.Keywords
This publication has 3 references indexed in Scilit:
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common DivisorsJournal of the ACM, 1971
- On Euclid's Algorithm and the Theory of SubresultantsJournal of the ACM, 1971
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967