Skip to main content
SpringerLink
Log in

Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems

  • Research Papers
  • Published:
aequationes mathematicae Aims and scope Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literaturhinweise

  1. Gröbner, W.,Moderne algebraische Geometrie (Springer-Verlag, Wien und Innsbruck 1949).

    Google Scholar 

  2. Gröbner, W.,Teoria degli ideali e geometria algebrica, inSeminari dell'Istituto Nazionale di Alta Matematica 1962–1963 (Edizione Cremonese, Roma 1964).

    Google Scholar 

  3. Gröbner, W., Mündliche Mitteilung im Math. Seminar der Universität Innsbruck, 1964.

  4. Hermann, G.,Die Frage der endlich vielen Schritte in der Theorie der Polynomideale, Math. Ann.95, 736–788 (1926).

    Article  Google Scholar 

  5. van der Waerden, B. L.,Moderne Algebra, 2. Band, 2. Auflage (Springer-Verlag, Berlin 1937).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Innsbruck, Innsbruck, Austria

    B. Buchberger

Authors
  1. B. Buchberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Buchberger, B. Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems. Aeq. Math. 4, 374–383 (1970). https://doi.org/10.1007/BF01844169

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Search

Navigation