THE VIRTUES OF LAZINESS - COMPLEXITY OF THE TANGENT CONE ALGORITHM

被引:0
|
作者
ASSI, A
MORA, T
机构
[1] UNIV NICE,DEPT MATH,F-06034 NICE,FRANCE
[2] UNIV GENOA,DIPARTIMENTO INFORMAT,I-16126 GENOA,ITALY
关键词
COMPUTATIONAL ALGEBRA; TANGENT CONE; STANDARD BASES; ALGEBRAIC COMPLEXITY;
D O I
10.1007/BF01200147
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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.
引用
收藏
页码:231 / 238
页数:8
相关论文
共 50 条