Finding connected components of a semialgebraic set in subexponential time

Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Gary S. Collins · Medical Entomology and Zoology · 1975 · 896 citations

Geometric Quantization, Finite Field, Algebraic Analysis +3

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 · 609 citations

Solving systems of polynomial inequalities in subexponential time

D. Yu. Grigor'ev, Nicolai Vorobjov · Journal of Symbolic Computation · 1988 · 325 citations

Mathematical Programming, Polynomial Inequalities, Engineering +5

Definability and fast quantifier elimination in algebraically closed fields

Joos Heintz · Theoretical Computer Science · 1983 · 312 citations

Algebraic Logic, Engineering, Automated Reasoning +4

Complexity of deciding Tarski algebra

D. Yu. Grigor'ev · Journal of Symbolic Computation · 1988 · 200 citations

Tarski Algebra, Engineering, Algebraic Complexity +5