Equations for the projective closure and effective Nullstellensatz

Greobner Bases : an algorithmic method in polynomial ideal theory

Bruno Buchberger · Medical Entomology and Zoology · 1985 · 1.1K citations

Natural Sciences, Computer Science, Mathematics +11

The complexity of the word problems for commutative semigroups and polynomial ideals

Ernst Mayr, Albert R. Meyer · Advances in Mathematics · 1982 · 506 citations · Full text

Computing, Computer Science, Mathematics +16

On computing the determinant in small parallel time using a small number of processors

S. J. Berkowitz · Information Processing Letters · 1984 · 354 citations

Computing, Computer Science, Parallel Algorithms +13

Definability and fast quantifier elimination in algebraically closed fields

Joos Heintz · Theoretical Computer Science · 1983 · 319 citations

Natural Sciences, Computer Science, Mathematics +12

Bounds for the Degrees in the Nullstellensatz

W. Dale Brownawell · Annals of Mathematics · 1987 · 257 citations

Natural Sciences, Computer Science, Mathematics +3