An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs

On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

James Renegar · Journal of Symbolic Computation · 1992 · 622 citations

Computing, Computer Science, Mathematics +14

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

On Relating Time and Space to Size and Depth

Allan Borodin · SIAM Journal on Computing · 1977 · 341 citations

Computing, Computer Science, Mathematics +17

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