## New Results on Quantifier Elimination Over Real Closed Fields and Applications to Constraint Databases (1999)

Venue: | Journal of the ACM |

Citations: | 32 - 4 self |

### BibTeX

@ARTICLE{Basu99newresults,

author = {Saugata Basu},

title = {New Results on Quantifier Elimination Over Real Closed Fields and Applications to Constraint Databases},

journal = {Journal of the ACM},

year = {1999},

volume = {46},

pages = {537--555}

}

### Years of Citing Articles

### OpenURL

### 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...