The membership problem for unmixed polynomial ideals is solvable in single exponential time

Introduction to Commutative Algebra.

D. J. Lewis, B. R. McDonald, M. F. Atiyah et al. · American Mathematical Monthly · 1970 · 1.7K citations

Non-commutative Algebra, Representation Theory, Modern Algebra +1

Greobner Bases : an algorithmic method in polynomial ideal theory

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

Algebraic Structure, Modern Algebra, Commutative Algebra +3

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

Ernst Mayr, Albert R. Meyer · Advances in Mathematics · 1982 · 499 citations

Topological Semigroups, Abstract Algebra, Engineering +8

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

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

Massively-parallel Computing, Array Computing, Engineering +10

Definability and fast quantifier elimination in algebraically closed fields

Joos Heintz · Theoretical Computer Science · 1983 · 312 citations

Algebraic Logic, Engineering, Automated Reasoning +4