Abstract
The Tangent Cone Algorithm is a variant of Buchberger Algorithm, to compute standard bases with respect to orderings which are not well-orderings, which is useful in computational local algebra. We show here that its complexity is the same as the one of Buchberger Algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gräbe, H.: The tangent cone algorithm and homogeneization, Preprint
Lazard, D.: Gröbner bases, Gaussian elimination and resolution of systems of polynomial equations, Proc. EUROCAL 83, Lect. Notes. Comp. Sci.162, 146–156 (1983)
Mora, T.: La queste del Saint Gra(AL): a computational approach to local algebra, Disc. Appl. Math.33, 161–190 (1991)
Mora, T., Pfister, G., Traverso, C: An introduction to the tangent cone algorithm. In: C. M. Hoffmann (ed.) Issues in robotics and non-linear geometry, JAI Press (1992)
Moreno, G.: An Ackermannian polynomial ideal, Proc. AAECC 9, Lect. Notes Comp. Sci.539, 269–280(1991)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Assi, A., Mora, T. The virtues of laziness: Complexity of the Tangent Cone Algorithm. AAECC 4, 231–238 (1993). https://doi.org/10.1007/BF01200147
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01200147