On the Combinatorial and Algebraic Complexity of Quantifier Elimination

@article{Basu1996OnTC,
  title={On the Combinatorial and Algebraic Complexity of Quantifier Elimination},
  author={Saugata Basu and Richard Pollack and Marie-Françoise Roy},
  journal={J. ACM},
  year={1996},
  volume={43},
  pages={1002-1045}
}
In this paper, a new algorithm for performing quantifier elimination from first order formulas over real closed fields in given. This algorithm improves the complexity of the asymptotically fastest algorithm for this problem, known to this data. A new feature of this algorithm is that the role of the algebraic part (the dependence on the degrees of the imput polynomials) and the combinatorial part (the dependence on the number of polynomials) are sparated. Another new feature is that the… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
17 Citations
8 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Gröbner bases: An algorithmic method in polynomial ideal theory

  • B. BUCHBERGER
  • Recent Trends in Multidimensional Systems Theory…
  • 1985
Highly Influential
4 Excerpts

Géométrie algébrique réelle

  • J. BOCHNAK, M. COSTE, ROY, M.F.
  • Springer-Verlag, New York.
  • 1987
Highly Influential
5 Excerpts

A new decision method for elementary algebra

  • A. SEIDENBERG
  • Ann. Math. 60, 365–374.
  • 1954
Highly Influential
7 Excerpts

Counting real zeros in the multivariate case

  • P. PEDERSEN, ROY, M.-F., A. SZPIRGLAS
  • Computational algebraic geometry, Eyssette et…
  • 1993
Highly Influential
3 Excerpts

Sur la complexité du principe de TarskiSeidenberg

  • J. HEINTZ, ROY, M.-F., P. SOLERNÒ
  • Bull. Soc. Math. France 118, 101–126.
  • 1990
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…