An Improved Algorithm for Quantifier Elimination Over Real Closed Fields

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 the combinatorial part of the complexity 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 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 and apply it to solve a problem arising in the field of constraint databases. No algorithm with reasonable complexity bound was known for this latter problem till now. We also point out interesting logical consequences of this algorithmic result, concerning the expressive power of a constraint query language over the reals. Moreover, our improved algorithm for performing quantifier elimination immediately leads to improved algorithms for several problems for which quantifier elimination is a basic step, for example, the problem of computing the closure of a given semi-algebraic set.

Authors

• Saugata Basu

Keywords

• Polynomials
• Database languages
• Fellows
• Arithmetic
• Costs
• History
• Quantifier Elimination
• Real Closed Field
• Event Of Interest
• Part Of Complex
• Algorithm For Problem
• Free Variables
• First-order Theory
• Proof Of Theorem
• Parametrized
• Finite Set
• Input Size
• Polynomial Of Degree
• Real Roots
• Output Size
• Closure Of The Set
• Formula Length
• Polynomials In Variables