Polynomial Hierarchy, Betti Numbers, and a Real Analogue of Toda’s Theorem
- 115 Downloads
Toda (in SIAM J. Comput. 20(5):865–877, 1991) proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P #P , namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class #P. This result, which illustrates the power of counting, is considered to be a seminal result in computational complexity theory. An analogous result in the complexity theory over the reals (in the sense of Blum–Shub–Smale real machines in Bull. Am. Math. Soc. (NS) 21(1): 1–46, 1989) has been missing so far. In this paper we formulate and prove a real analogue of Toda’s theorem. Unlike Toda’s proof in the discrete case, which relied on sophisticated combinatorial arguments, our proof is topological in nature. As a consequence of our techniques, we are also able to relate the computational hardness of two extremely well-studied problems in algorithmic semi-algebraic geometry: the problem of deciding sentences in the first-order theory of the reals with a constant number of quantifier alternations, and that of computing Betti numbers of semi-algebraic sets. We obtain a polynomial time reduction of the compact version of the first problem to the second. This latter result may be of independent interest to researchers in algorithmic semi-algebraic geometry.
KeywordsPolynomial hierarchy Betti numbers Semi-algebraic sets Toda’s theorem
Mathematics Subject Classification (2000)14P10 14P25 68W30
Unable to display preview. Download preview PDF.
- 3.S. Basu, Algorithmic semi-algebraic geometry and topology—recent progress and open problems, in Surveys on Discrete and Computational Geometry: Twenty Years Later, Contemporary Mathematics, vol. 453 (American Mathematical Society, Providence, 2008), pp. 139–212. Google Scholar
- 9.L. Blum, F. Cucker, M. Shub, S. Smale, Complexity and Real Computation (Springer, New York, 1998). With a foreword by Richard M. Karp. MR 99a:68070. Google Scholar
- 11.J. Bochnak, M. Coste, M.-F. Roy, Géométrie Algébrique Réelle (second edition in English: Real Algebraic Geometry), Ergebnisse der Mathematik und ihrer Grenzgebiete (Results in Mathematics and Related Areas), vol. 12(36) (Springer, Berlin, 1987 (1998)). MR 949442 (90b:14030). Google Scholar
- 12.P. Bürgisser, F. Cucker, Variations by complexity theorists on three themes of Euler, Bézout, Betti, and Poincaré, in Complexity of Computations and Proofs, Quad. Mat., vol. 13 (Dept. Math., Seconda Univ. Napoli, Caserta, 2004), pp. 73–151. MR 2131406 (2006c:68053). Google Scholar