On the complexity of Gröbner bases conversion

Journal of Symbolic Computation

Volumn 28, Issue 1-2, 1999, Pages 265-273

  Kalkbrener, Michael ^a  

^a DEUTSCHE BANK AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (18)

1. Amrhein, B., Gloor, O., Küchlin, W. (1996). Walking faster. In Proceedings DISCO'96, Karlsruhe, Germany, LNCS 1128, pp. 150-161. Berlin, Springer.
2. Bayer, D. (1982). The division algorithm and the Hilbert scheme. Ph. D. Thesis, Harvard University, Department of Mathematics, Cambridge, MA, U.S.A.
3. Buchberger, B. (1965). Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph. D. Thesis, University of Innsbruck, Department of Mathematics, Innsbruck, Austria.
4. Buchberger, B. (1970). ein algorithmisches kriterium für die lösbarkeit eines algebraischen gleichungssystems. Aeq. Math., 4, 374-383.
5. Collart, S., Kalkbrener, M., Mall, D. (1997). Converting bases with the Gröbner walk. J. Symb. Comput., 24, 465-470.
6. Collart, S., Mall, D. (1997). Toric degenerations of polynomial ideals and geometric localisation of fans. J. Symb. Comput., 24, 443-464.
7. Faugère, J. C. (1994). Résolution des systèmes d'équations algébriques. Ph. D. Thesis, University of Paris VI, Department of Mathematics, Paris, France.
8. Faugère, J. C., Gianni, P., Lazard, D., Mora, T. (1993). Efficient computation of zero-dimensional Gröbner bases by change of ordering. J. Symb. Comput., 16, 329-344.
9. Giusti, M. (1988). Combinatorial dimension theory of algebraic varieties. J. Symb. Comput., 6, 249-265.
10. Hoffmann, C. M. (1989). Geometric and Solid Modeling: An Introduction. San Mateo, CA, U.S.A., Morgan Kaufmann.
11. Huynh, D. T. (1986). A superexponential lower bound for Gröbner bases and Church-Rosser commutative Thue systems. Inf. Control, 68, 196-206.
12. Kalkbrener, M. (1996). Implicitization by Gröbner basis conversion. Euromath. Bull., 2, 197-204.
13. Licciardi, S., Mora, T. (1994). Implicitization of hypersurfaces and curves by the Primbasissatz and basis conversion. In Proceedings ISSAC'94, Oxford, U.K., pp. 191-196.
14. Mayr, E.W., Meyer, A.R. (1982). The complexity of the word problem for commutative semigroups and polynomial ideals. Adv. Math., 46, 305-329.
15. Möller, H. M., Mora, T. (1984). Upper and lower bounds for the degree of Gröbner bases. In Proceedings EUROCAL'84, Cambridge, U.K., LNCS 174, pp. 172-183. Berlin, Springer.
16. Mora, T., Robbiano, L. (1988). The Gröbner fan of an ideal. J. Symb. Comput., 6, 183-208.
17. Noro, M., Yokoyama, K. (1995). New methods for the change-of-ordering in Gröbner basis computation. Research Report ISIS-RR-95-8E, Institute for Social Information Science, FUJITSU, Numazu, Japan.
18. Traverso, C. (1996). Hilbert functions and Buchberger algorithm. J. Symb. Comput., 22, 355-376.