Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy

It is known (Boppana et a;., 1987) that if every language in coNP has a constant-round interactive proof system, then the polynomial hierarchy collapses. On the other hand, Lund et al. (1992) have shown that #SAT, the #P-complete function that outputs the number of satisfying assignments of a Boolean formula, can be computed by a linear-round interactive protocol. As a consequence, the coNP-complete set SAT has a proof system with linear rounds of interaction. We show that if every set in coNP has a polylogarithmic-round interactive protocol then the exponential hierarchy collapses to the third level. In order to prove this, we obtain an exponential version of Yap's result (1983), and improve upon an exponential version of the Karp-Lipton theorem (1980), obtained first by Buhrman and Homer (1992).

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  José L. Balcázar,et al.  Structural Complexity II , 2012, EATCS.

[3]  Ran Canetti.  More on BPP and the Polynomial-Time Hierarchy , 1996, Inf. Process. Lett..

[4]  Journal of the Association for Computing Machinery , 1961, Nature.

[5]  Steven Homer,et al.  Computability and Complexity Theory , 2001, Texts in Computer Science.

[6]  Stathis Zachos,et al.  A Decisive Characterization of BPP , 1986, Inf. Control..

[8]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[9]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[10]  Alexander Russell,et al.  Symmetric alternation captures BPP , 1998, computational complexity.

[11]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

[12]  Vikraman Arvind,et al.  If NP has Polynomial-Size Circuits, then MA=AM , 1995, Theor. Comput. Sci..

[13]  Stathis Zachos,et al.  Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..

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

[15]  Oded Goldreich,et al.  On the Complexity of Interactive Proofs with Bounded Communication , 1998, Inf. Process. Lett..

[16]  Leonard M. Adleman,et al.  Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[17]  Jin-Yi Cai,et al.  Competing provers yield improved Karp-Lipton collapse results , 2005, Inf. Comput..

[18]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[19]  Leonid A. Levin,et al.  Checking computations in polylogarithmic time , 1991, STOC '91.

[20]  László Babai,et al.  Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..

[21]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[22]  Stathis Zachos,et al.  Probabalistic Quantifiers vs. Distrustful Adversaries , 1987, FSTTCS.

[23]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[24]  Chee-Keng Yap,et al.  Some Consequences of Non-Uniform Conditions on Uniform Classes , 1983, Theor. Comput. Sci..

[25]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[26]  Carsten Lund.  Power of interaction , 1992, ACM Distinguished dissertations.

[27]  Avi Wigderson,et al.  On interactive proofs with a laconic prover , 2001, computational complexity.

[28]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[30]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[31]  Shafi Goldwasser,et al.  Private coins versus public coins in interactive proof systems , 1986, STOC '86.

[32]  Harry Buhrman,et al.  Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy , 1992, FSTTCS.