Oblivious symmetric alternation

Abstract

We introduce a new class O 2p as a subclass of the symmetric alternation class S 2p An O 2p proof system has the flavor of an S 2p proof system, but it is more restrictive in nature. In an S 2p proof system, we have two competing provers and a verifier such that for any input, the honest prover has an irrefutable certificate. In an O 2p proof system, we require that the irrefutable certificates depend only on the length of the input, not on the input itself. In other words, the irrefutable proofs are oblivious of the input. For this reason, we call the new class oblivious symmetric alternation. While this might seem slightly contrived, it turns out that this class helps us improve some existing results. For instance, we show that if NP ⊂ P/poly then PH = O 2p, whereas the best known collapse under the same hypothesis was PH = S 2p. We also define classes YO 2p and NO 2P, bearing relations to O 2P as NP and coNP are to P, and show that these along with O 2p form a hierarchy, similar to the polynomial hierarchy. We investigate other inclusions involving these classes and strengthen some known results. For example, we show that MA ⊆ NO 2p which sharpens the known result MA ⊆ S 2p [16]. Another example is our result that AM ⊆ O 2 · NP ⊆ ∏ 2p, which is an improved upper bound on AM. Finally, we also prove better collapses for the 2-queries problem as discussed by [12,1,7]. We prove that P Np[1]= P NP[2] ⇒ PH = NO 2p∩YO 2p. © Springer-Verlag Berlin Heidelberg 2006.