Journal of the ACM Bibliography
George E. Collins.
Subresultants and reduced polynomial remainder sequences. Journal
of the ACM, 14(1):128-142, January 1967.
[BibTeX entry]
Selected papers that cite this one
- Michael Ben-Or and Prasoon Tiwari. Simple algorithms for
approximating all roots of a polynomial with real roots.
Journal of Complexity, 6(4):417-442, December 1990.
- Dario Bini and Luca Gemignani. Fast parallel
computation of the polynomial remainder sequence via Bézout and
Hankel matrices. SIAM Journal on Computing,
24(1):63-77, February 1995.
- 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. The
calculation of multivariate polynomial resultants. Journal of
the ACM, 18(4):515-532, October 1971.
- Laureano González-Vega. An improved
upper complexity bound for the topology computation of a real algebraic
plane curve. Journal of Complexity, 12(4):527-544,
December 1996.
- Michael T. McClellan. The exact solution of systems of
linear equations with polynomial coefficients. Journal of the
ACM, 20(4):563-588, October 1973.
- Victor Y. Pan. Parallel computation of
polynomial GCD and some related parallel computations over abstract
fields. Theoretical Computer Science, 162(2):173-223,
20 August 1996.
Selected references
Shortcuts: