Subresultants under composition

Journal of Symbolic Computation

Volumn 23, Issue 4, 1997, Pages 355-365

  Hong, Hoon ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (12)

1. Barton, D., Zippel, R. (1985). Polynomial decomposition algorithms. J. Symbolic Computation, 1(2): 159-168.
2. Binder, F. (1996). Fast Computations in the lattice of polynomial rational function fields. In Proc. ISSAC-96, pp. 43-48. ACM Press.
3. Brown, W.S., Traub, J.F. (1971). On Euclid's algorithm and the theory of subresultants. Journal ACM, 18(4):505-514.
4. Collins, G.E. (1967). Subresultants and reduced polynomial remainder sequences. Journal ACM, 14: 128-142.
5. Hong, H. (1995). Multivariate Resultants Under Composition. Technical Report 95-56, Research Institute for Symbolic Computation, Johannes Kepler University, A-4040 Linz, Austria. Submitted for publication.
6. Hong, H. (1997). Groebner basis under composition I. J. Symbolic Computation. In press.
7. Kozen, D., Landau, S. (1989). Polynomial decomposition algorithms. J. Symbolic Computation, 7(5): 445-456.
8. Loos, R.G.K. (1982). Generalized polynomial remainder sequences. In Buchberger, B., Collins, G.E., Loos, R.G.K., (eds), Computer Algebra, Symbolic and Algebraic Computation, pp. 115-137. Springer-Verlag, Wien-New York.
9. McKay, J., Wang, S. (1989). A chain rule for the resultant of two polynomials. Arch. Math., 53:347-351.
10. Mishra, B. (1993). Algorithmic Algebra. New York, Springer-Verlag.
11. von zur Gathen, J. (1990a). Functional decomposition of polynomials: the tame case. J. Symbolic Computation, 9(3):281-300.
12. von zur Gathen, J. (1990b). Functional decomposition of polynomials: the wild case. J. Symbolic Computation, 10(5):437-452.