Polynomial Hierarchy, Betti Numbers, and a Real Analogue of Toda’s Theorem
- 19 February 2010
- journal article
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 10 (4) , 429-454
Abstract
No abstract availableKeywords
All Related Versions
This publication has 35 references indexed in Scilit:
- Approximation of definable sets by compact families, and upper bounds on homotopy and homologyJournal of the London Mathematical Society, 2009
- O-MINIMAL CECH COHOMOLOGYThe Quarterly Journal of Mathematics, 2007
- Computing the First Betti Number of a Semi-Algebraic SetFoundations of Computational Mathematics, 2007
- Counting Complexity Classes for Numeric Computations. III: Complex Projective SetsFoundations of Computational Mathematics, 2005
- BETTI NUMBERS OF SEMIALGEBRAIC AND SUB-PFAFFIAN SETSJournal of the London Mathematical Society, 2004
- On the combinatorial and algebraic complexity of quantifier eliminationJournal of the ACM, 1996
- Construction of roadmaps in semi-algebraic setsApplicable Algebra in Engineering, Communication and Computing, 1993
- Computing Roadmaps of General Semi-Algebraic SetsThe Computer Journal, 1993
- Counting connected components of a semialgebraic set in subexponential timecomputational complexity, 1992
- Probabilistic complexity classes and lownessJournal of Computer and System Sciences, 1989