Journal of the ACM Bibliography
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.
[BibTeX entry]
Additional Key Words and Phrases:
algebra, coefficient growth, Euclid's algorithm, greatest common
divisors, intermediate expression swell, polynomial remainder sequences,
polynomials, subresultants
Selected papers that cite this one
- 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.
- George E. Collins. The
calculation of multivariate polynomial resultants. Journal of
the ACM, 18(4):515-532, October 1971.
- Erich Kaltofen. Effective Noether
irreducibility forms and applications. Journal of Computer and
System Sciences, 50(2):274-295, April 1995.
- Leonid Khachiyan and Lorant Porkolab. Computing integral
points in convex semi-algebraic sets. In 38th Annual Symposium
on Foundations of Computer Science, pages 162-171, Miami Beach,
Florida, 20-22 October 1997. IEEE.
- C. Andrew Neff and John H. Reif. An efficient algorithm
for the complex roots problem. Journal of Complexity,
12(2):81-115, June 1996.
- 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.
- John H. Reif. Work
efficient parallel solution of toeplitz systems and polynomial GCD.
In Proceedings of the Twenty-Seventh Annual ACM Symposium on the
Theory of Computing, pages 751-761, Las Vegas, Nevada, 29 May-1
June 1995.
Selected references
Shortcuts: