• Publications
  • Influence
A criterion for detecting unnecessary reductions in the construction of Groebner bases
We present a new criterion that may be applied in an algorithm for constructing Grobner-bases of polynomial ideals. Expand
  • 361
  • 28
An Algorithmic Method in Polynomial Ideal Theory
  • 270
  • 25
Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
  • B. Buchberger
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 1 March 2006
This is the English translation (by Michael P. Abramson) of the PhD thesis of Bruno Buchberger, in which he introduced the algorithmic theory of Grobner bases. Expand
  • 554
  • 20
The Construction of Multivariate Polynomials with Preassigned Zeros
We present an algorithm for constructing a basis of the ideal of all polynomials, which vanish at a preassigned set of points {y1,...,ym} ⊂ Kn, K a field. Expand
  • 176
  • 20
Applications of Gröbner Bases in Non-linear Computational Geometry
  • B. Buchberger
  • Computer Science, Mathematics
  • Trends in Computer Algebra
  • 1987
  • 122
  • 12
Computer algebra symbolic and algebraic computation
Computer algebra is an alternative and complement to numerical mathematics. Expand
  • 399
  • 10