## On the Combinatorial and Algebraic Complexity of Quantifier Elimination (1996)

### Cached

### Download Links

- [www.math.gatech.edu]
- [www.math.lsa.umich.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 199 - 29 self |

### BibTeX

@MISC{Basu96onthe,

author = {Saugata Basu and Richard Pollack and Marie-Francoise Roy},

title = {On the Combinatorial and Algebraic Complexity of Quantifier Elimination},

year = {1996}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper, a new algorithm for performing quantifier elimination from first order formulas over real closed fields is given. This algorithm improves the complexity of the asymptotically fastest algorithm for this problem, known to this date. A new feature of this algorithm is that the role of the algebraic part (the dependence on the degrees of the input polynomials) and the combinatorial part (the dependence on the number of polynomials) are separated. Another new feature is that the degrees of the polynomials in the equivalent quantifier-free formula that is output, are independent of the number of input polynomials. As special cases of this algorithm, new and improved algorithms for deciding a sentence in the first order theory over real closed fields, and also for solving the existential problem in the first order theory over real closed fields, are obtained.