Skip to main content

Advertisement

Springer Nature Link
Log in

The virtues of laziness: Complexity of the Tangent Cone Algorithm

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

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.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Gräbe, H.: The tangent cone algorithm and homogeneization, Preprint

  2. 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)

    Google Scholar 

  3. Mora, T.: La queste del Saint Gra(AL): a computational approach to local algebra, Disc. Appl. Math.33, 161–190 (1991)

    Google Scholar 

  4. 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)

  5. Moreno, G.: An Ackermannian polynomial ideal, Proc. AAECC 9, Lect. Notes Comp. Sci.539, 269–280(1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department Mathématique, Université de Nice, Germany

    Abdallah Assi

  2. Dipartimento Informatica, Università di Genova, Germany

    Teo Mora

Authors
  1. Abdallah Assi
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Teo Mora
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01200147

Keywords