Skip to main content
SpringerLink
Log in

Upper and lower bounds for the degree of Groebner bases

  • Groebner Basis Algorithms
  • Conference paper
  • First Online:
EUROSAM 84 (EUROSAM 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 174))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.A.BAYER, The division algorithm and the Hilbert scheme, Ph.D.Thesss,Harvard (1982)

    Google Scholar 

  2. B. BUCHBERGER, A criterion for detecting unnecessary reductions in the construction of Gröbner bases, Proc.EUROSAM 79, L.N.Comp.Sci. 72 (1979) 3–21

    Google Scholar 

  3. B.BUBHBERGER, A note on the complexity of constructing Gröbner bases, Proc.EUROCAL 83, L.N.Comp.Sci.162 (1983)

    Google Scholar 

  4. B.BUCHBERGER,F.WINKLER, Miscellaneous results on the construction of Gröbner bases for polynomial ideals,Bericht 137;Inst.Math.Univ.Linz (1979)

    Google Scholar 

  5. R. HARTSHORNE, Connectedness of the Hilbert scheme,Publ.Math.I.H.E.S. 29 (1966),5–48

    Google Scholar 

  6. G. HERMANN, Die Frage der endlichen viele Schritten in der Theorie der Polynomideale,Math.Ann. 95 (1926), 736–788

    Google Scholar 

  7. D.LAZARD, Gröbner bases,Gaussian elimination and resolution of systems of algebraic equations, Proc.EUROCAL 83, L.N.Comp.Sci. 162 (1983)

    Google Scholar 

  8. E.W. MAYR,A.R. MEYER, The complexity of the word problems for commutative semigroups and polynomial ideals, Adv.Math.46 (1982),305–329

    Google Scholar 

  9. J. RIORDAN, Combinatorial identities,Wiley, New York,(1968)

    Google Scholar 

  10. B.RENSCHUCH,Elementare und praktische Idealtheorie,DWV Berlin (1976)

    Google Scholar 

  11. M.GIUSTI, Some effectivity problems in polynomial ideal theory, these Proceedings

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Mathematik und Informatik, FernUniversität Hagen, Hagen, BRD

    H. Michael Möller

  2. Istituto di Matematica, Università di Genova, Genova, Italy

    Ferdinando Mora

Authors
  1. H. Michael Möller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ferdinando Mora
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Fitch

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Möller, H.M., Mora, F. (1984). Upper and lower bounds for the degree of Groebner bases. In: Fitch, J. (eds) EUROSAM 84. EUROSAM 1984. Lecture Notes in Computer Science, vol 174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032840

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13350-6

  • Online ISBN: 978-3-540-38893-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation