The Habicht approach to subresultants

Journal of Symbolic Computation

Volumn 21, Issue 1, 1996, Pages 1-14

  Ho, Chung Jen ^a   Yap, Chee Keng ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0029715613     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0001     Document Type: Article

References (8)

1. Brown, W.S., Traub, J.F. (1971). On Euclid's algorithm and the theory of subresultants. Journal of the ACM 18, 505-514.
2. Brown, W.S. (1978). The subresultant PRS algorithm. ACM Transaction on Mathematical Software 4, 237-249.
3. Collins, G.E. (1966). Polynomial remainder sequences and determinants. American Mathematical Monthly 73, 708-712.
4. Collins, G.E. (1967). Subresultants and reduced polynomial remainder sequences. Journal of the ACM 14, 128-142.
5. Habicht, W. (1948). Einer Verallgemeinerung des Sturmschen Wurzelzählverfahrens. Comm. Math. Helvetici 21, 99-116.
6. Ho, C.-J. (1989). Topics in algebraic computing: subresultants, GCD, factoring and primary ideal decomposition. PhD thesis, Courant Institute, New York University.
7. Ho, C.-J., Yap, C. (1987). Polynomial remainder sequences and theory of subresultants. Report 319, New York University - Courant Institute, Robotics Laboratory.
8. Loos, R. (1983). Generalized polynomial remainder sequences. In B. Buchberger, G. E. Collins, and R. Loos, editors, Computer Algebra (2nd edition). New York: Springer-Verlag.