ISSN:
1432-0622
Keywords:
Computational algebra
;
Tangent cone
;
Standard bases
;
Algebraic complexity
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
,
Technology
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01200147
Permalink