Journal of the ACM Bibliography

Additional Key Words and Phrases: polynomials, resultants, elimination, symbolic manipulation, algebraic algorithms, computing time analyses, Sylvester's determinant, exact arithmetic, modular arithmetic, polynomial equation systems, SAC-1, Runge-Kutta methods

Selected papers that cite this one

• W. S. Brown. On Euclid's algorithm and the computation of polynomial greatest common divisors. Journal of the ACM, 18(4):478-504, October 1971.

• W. S. Brown and J. F. Traub. On Euclid's algorithm and the theory of subresultants. Journal of the ACM, 18(4):505-514, October 1971.

• Mark J. Encarnación. Black-box polynomial resultants. Information Processing Letters, 61(4):201-204, 28 February 1997.

• Lee E. Heindel. Integer arithmetic algorithms for polynomial real zero determination. Journal of the ACM, 18(4):533-548, October 1971.

• Michael T. McClellan. The exact solution of systems of linear equations with polynomial coefficients. Journal of the ACM, 20(4):563-588, October 1973.

Selected references

• W. S. Brown. On Euclid's algorithm and the computation of polynomial greatest common divisors. Journal of the ACM, 18(4):478-504, October 1971.

• W. S. Brown and J. F. Traub. On Euclid's algorithm and the theory of subresultants. Journal of the ACM, 18(4):505-514, October 1971.

• George E. Collins. Subresultants and reduced polynomial remainder sequences. Journal of the ACM, 14(1):128-142, January 1967.

• Lee E. Heindel. Integer arithmetic algorithms for polynomial real zero determination. Journal of the ACM, 18(4):533-548, October 1971.

Shortcuts: