Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields

Introduction to Algebraic Geometry.

Alice T. Schafer, Serge Lang · American Mathematical Monthly · 1960 · 522 citations

Natural Sciences, Mathematics, Algebra +10

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

Constructions in algebra

A. Seidenberg · Transactions of the American Mathematical Society · 1974 · 273 citations · Full text

Natural Sciences, Mathematics, Algebra +10