Bounding Queries in the Analytic Polynomial-Time Hierarchy

Abstract In a previous paper the present authors (Baier and Wagner, 1996) investigated an ∃-∀-hierarchy over P using word quantifiers as well as two types of set quantifiers, the so-called analytic polynomial-time hierarchy. The fact that some constructions there result in a bounded number of oracle queries and the recent PCP results which can be expressed by set quantifiers with a bounded number of queries motivated us to examine a hierarchy which extends the analytic polynomial-time hierarchy by considering restrictions on the number of oracle queries. This hierarchy is called bounded analytic polynomial-time hierarchy. We show that every class from this hierarchy having a certain normal form coincides with one of the classes NP, coNP, PSPACE, Σkexp or Πkexp (k ⩾ 1). All these characterizations remain valid if the queries are asked in a nonadaptive form, i.e. in “parallel”.

[1]  Celia Wrathall,et al.  Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[2]  L. Fortnow,et al.  On the power of multi-power interactive protocols , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[3]  Heribert Vollmer,et al.  On operators of higher types , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[4]  Heribert Vollmer,et al.  On Type-2 Probabilistic Quantifiers , 1996, ICALP.

[5]  AroraSanjeev,et al.  Probabilistic checking of proofs , 1998 .

[6]  Klaus W. Wagner,et al.  The Analytic Polynomial‐Time Hierarchy , 1998, Math. Log. Q..

[7]  Carsten Lund,et al.  Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[8]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[9]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[10]  Jin-Yi Cai,et al.  PSPACE Survives Constant-Width Bottlenecks , 1991, Int. J. Found. Comput. Sci..

[11]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[12]  Pekka Orponen,et al.  Complexity Classes of Alternating Machines with Oracles , 1983, ICALP.