An improved non-modular polynomial GCD algorithm

Authors:
Anthony C. Hearn
Affiliations:
University of Utah, Utah
Venue:
ACM SIGSAM Bulletin
Year:
1972

Citing 4
Cited 2

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Subresultants and Reduced Polynomial Remainder Sequences

Journal of the ACM (JACM)
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

Journal of the ACM (JACM)
On Euclid's Algorithm and the Theory of Subresultants

Journal of the ACM (JACM)

The Subresultant PRS Algorithm

ACM Transactions on Mathematical Software (TOMS)
Algebraic algorithm descriptions as programs

ACM SIGSAM Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

An improved non-modular algorithm for the calculation of the greatest common divisor of two multivariate polynomials is presented.