Reduced Gröbner bases under composition

Journal of Symbolic Computation

Volumn 26, Issue 4, 1998, Pages 433-444

  Gutierrez, Jaime ^a   Rubio San Miguel, Rosario ^a  

^a UNIVERSITY OF CANTABRIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (12)

1. Barton, D., Zippel, R. (1985). Polynomial decomposition algorithms. J. Symb. Comput., 1, 159-158.
2. Becker, T., Weispfenning, V. (1993). Gröbner Bases. New York-Berlin-Heidelberg, GTM, Springer Verlag.
3. Binder, F. (1996). Fast Computations in the lattice of polynomial rational function fields. Proc. ISSAC-96. Oxford, ACM Press.
4. Buchberger, B. (1965). Ein algorithmus zum Auffiden der Baiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph D Thesis, Universität Innsbruck, Austria.
5. Buchberger, B. (1985). Gröbner bases: an algorithmic method in polynomial ideal theory. In Bose, N.K., ed. Recent Trends in Multidimensional Systems Theory, D. Reidel.
6. Cox, D., Little, J., Òshea, D. (1992). Ideals, Varieties, and Algorithms. New York-Berlin-Heidelberg, UTM, Springer.
7. Gutierrez, J., Ruiz De Velasco, C., Recio, T. (1989). A polynomial decomposition algorithm of almost quadratic complexity. Lect. Notes Comput. Sci., 358, pp. 351-356. Berlin, Springer.
8. Gutierrez, J. (1991). Polynomial decomposition algorithm over factorial Domains. Comptes Rendues Mathematiques de l'Acad. des Sci. XIII, 81-86.
9. Hong, H. (1996). Gröbner basis under composition II. Proc. ISSAC-96. ACM Press.
10. Hong, H. (1995). Gröbner basis under composition I. J. Symb. Comput., 25, 643-663.
11. Kozen, D., Landau, S. (1989). Polynomial decomposition algorithms. J. Symb. Comput., 7, 445-456.
12. von zur Gathen, J. (1990). Functional decomposition of polynomials: the tame case. J. Symb. Comput., 9, 281-300.