Abstract

In this paper we give a new algorithm for quantifier elimination in the first order theory of real closed fields that improves the complexity of the best known algorithm for this problem till now. Unlike previously known algorithms [3, 28, 22] the combinatorial part of the complexity (the part depending on the number of polynomials in the input) of this new algorithm is independent of the number of free variables. Moreover, under the assumption that each polynomial in the input depend only on a constant number of the free variables, the algebraic part of the complexity (the part depending on the degrees of the input polynomials) can also be made independent of the number of free variables. This new feature of our algorithm allows us to obtain a new algorithm for a variant of the quantifier elimination problem. We give an almost optimal algorithm for this new problem, which we call the uniform quantifier elimination problem. Using the uniform quantifier elimination algorithm, we give a...

Citations

460	A decision method for elementary algebra and geometry - TARSKI - 1951
318	P.Z.: Constraint Query Languages - Kanellakis, Kuper, et al. - 1995
308	Quantifier elimination for real closed fields by cylindrical algebraic decomposition - COLLINS - 1975
294	Lectures on Polytopes - Ziegler - 1995
247	Principles of Database Systems - Ullman - 1980
177	On the combinatorial and algebraic complexity of quantifier elimination - Basu, Pollack, et al. - 1996
149	Logic and the challenge of computer science - Gurevich - 1988
136	Géométrie algébrique réelle - Bochnak, Coste, et al. - 1987
119	On local and nonlocal properties - Gaifman - 1982
112	Probabilities on finite models - Fagin - 1976
81	Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput - Sharir - 1994
72	A new decision method for elementary algebra - Seidenberg - 1954
71	Relational expressive power of constraint query languages - Benedikt, Dong, et al. - 1998
66	The complexity of linear problems in fields - WEISPFENNING - 1988
61	Constraint programming and database query languages - Kanellakis, Goldin - 1994
56	New bounds for lower envelopes in three dimensions, with applications to visbility in terrains - Halperin, Sharir - 1994
56	On the computational complexity and geometry of the first order theory of the reals - Renegar - 1992
54	Finitely Representable Databases., in "J - GRUMBACH, SU - 1997
40	On Range Searching with Semialgebraic Sets. Discrete and Computational Geometry - Agarwal, Matouˇsek - 1994
31	Sur la complexité du principe de TarskiSeidenberg - Heintz, Roy, et al. - 1990
30	The Complexity of deciding Tarski algebra - Grigor’ev - 1988
26	On the structure of queries in constraint query languages - Benedikt, Libkin - 1996
26	Almost tight upper bounds for the single cell and zone problems in three dimensions, Discrete Comput - Halperin, Sharir - 1995
24	Finite model theory - a personal perspective, Theoret - Fagin - 1993
20	Description of the connected components of a semialgebraic set in single exponential time, Discrete and Computational Geometry 11 - Heintz, Roy, et al. - 1994
17	Computational geometry: a retrospective - Chazelle - 1994
16	On the combinatorial and topological complexity of a single cell, Discrete and Computational Geometry - Basu - 2003
10	Complexity of computing semialgebraic descriptions of the connected components of a semialgebraic set - Basu, Pollack, et al. - 1998
9	Dense Order Constraint Databases - Grumbach, Su - 1995
7	Ehrenfeucht an application of games to the completeness problem for formalized theories - unknown authors - 1961
3	Uniform Quantifier Elimination and Constraint Query - Basu - 1997
2	Relational Languages over Interpreted Structure - Benedikt, Libkin - 1997
2	M.-.F Roy Thom's lemma, the coding of real algebraic numbers and the topology of semi-algebraic sets - Coste - 1988