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

Journal of Symbolic Computation

Volumn 13, Issue 3, 1992, Pages 255-299

  Renegar, James ^a  

^a Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85025505234     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(10)80003-3     Document Type: Article

References (33)

1. A bibliography of quantifier elimination for real closed fields
2. Lower bounds for algebraic computation trees
3. The complexity of elementary algebra and geometry
4. On a theory of computation and complexity over the real numbers: NP-compIeteness, recursive functions and universal machines
5. The Godel incompleteness theorem and decidability over a ring
6. Some algebraic and geometric computations in PSPACE
7. J. Symbolic Computation
8. Complexity of quantifier elimination in the theory of algebraically closed fields
9. Decision procedures for real and p-adic fields
10. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Second GI Conference on Automata Theory and Formal Languages
11. Fast parallel matrix inversion algorithms
12. Algorithmes rapides en sequential et en parallele pour l'élimination de quantificateurs en géométrie élémentaire
13. Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
14. The complexity of the decision problem for the first order theory of algebraically closed fields
15. The complexity of deciding Tarski algebra
16. Solving systems of polynomial inequalities in subexponential time
17. Definability and fast quantifier elimination in algebraically closed fields
18. On the complexity of semialgebraic sets
19. Sur la complexité du principe de Tarski-Seidenberg
20. Quantifier elimination in the first-order theory of algebraically closed fields
21. A new polynomial-time algorithm for linear programming
22. A polynomial algorithm in linear programming
23. On the Betti numbers of real varieties
24. A polynomial time algorithm, based on Newton's method, for linear programming
25. A faster PSPACE algorithm for the existential theory of the reals
26. On the computational complexity of approximating solutions for real algebraic formulae
27. Recent progress on the complexity of the decision problem for the reals
28. A new decision method for elementary algebra
29. Lower bounds for algebraic decision trees
30. A strongly polynomial algorithm for solving combinatorial linear programs
31. Alfred Tarski's elimination theory for real closed fields