Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory

This publication has 12 references indexed in Scilit:

• New decision algorithms for finitely presented commutative semigroups
  Computers & Mathematics with Applications, 1981
• A simplified proof of the characterization theorem for Gröbner-bases
  ACM SIGSAM Bulletin, 1980
• Über B. Buchbergers verfahren, systeme algebraischer gleichungen zu lösen
  Journal of Number Theory, 1978
• The diamond lemma for ring theory
  Advances in Mathematics, 1978
• Some properties of Gröbner-bases for polynomial ideals
  ACM SIGSAM Bulletin, 1976
• A theoretical basis for the reduction of polynomials to canonical forms
  ACM SIGSAM Bulletin, 1976
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
  Aequationes mathematicae, 1970
• Resolution of Singularities of an Algebraic Variety Over a Field of Characteristic Zero: I
  Annals of Mathematics, 1964
• Die Frage der endlich vielen Schritte in der Theorie der Polynomideale
  Mathematische Annalen, 1926
• Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors
  American Journal of Mathematics, 1913