The virtues of laziness: Complexity of the tangent cone algorithm

DOI10.1007/BF01200147zbMath0821.13012MaRDI QIDQ1311617

Abdallah Assi, Ferdinando Mora

Publication date: 25 September 1995

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

Gröbner basesstandard basiscomplexity of the tangent cone algorithmideal theory of local rings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Ideals and multiplicative ideal theory in commutative rings (13A15) Local rings and semilocal rings (13H99)

Cites Work

• La queste del Saint \(\text{Gr}_ a(\text{AL})\): A computational approach to local algebra
• The tangent cone algorithm and homogenization
• Unnamed Item
• Unnamed Item

This page was built for publication: The virtues of laziness: Complexity of the tangent cone algorithm