In search of an easy witness: exponential time vs. probabilistic polynomial time

Restricting the search space {0, 1}/sup n/ to the set of truth tables of "easy" Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we establish a number of results relating the complexity of exponential-time and probabilistic polynomial-time complexity classes. In particular, we show that NEXP/spl sub/P/poly/spl hArr/NEXP=MA; this can be interpreted to say that no derandomization of MA (and, hence, of promise-BPP) is possible unless NEXP contains a hard Boolean function. We also prove several downward closure results for ZPP, RP, BPP, and MA; e.g., we show EXP=BPP/spl hArr/EE=BPE, where EE is the double-exponential time class and BPE is the exponential-time analogue of BPP.

[1]  Noam Nisan,et al.  Hardness vs Randomness , 1994, J. Comput. Syst. Sci..

[2]  Neil Immerman,et al.  Sparse sets in NP-P: Exptime versus nexptime , 1983, STOC.

[3]  Valentine Kabanets.  Easiness Assumptions and Hardness Tests: Trading Time for Zero Error , 2001, J. Comput. Syst. Sci..

[4]  José D. P. Rolim,et al.  Hitting Properties of Hard Boolean Operators and their Consequences on BPP , 1996, Electron. Colloquium Comput. Complex..

[5]  Lance Fortnow,et al.  Nonrelativizing separations , 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

[6]  Chi-Jen Lu.  Derandomizing Arthur—Merlin games under uniform assumptions , 2001, computational complexity.

[7]  Luca Trevisan,et al.  Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[8]  Lance Fortnow,et al.  Comparing notions of full derandomization , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[9]  Carsten Lund,et al.  Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.

[10]  Valentine Kabanets,et al.  Easiness assumptions and hardness tests: trading time for zero error , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

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

[12]  Noam Nisan,et al.  BPP has subexponential time simulations unless EXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[13]  Oded Goldreich,et al.  Modern Cryptography, Probabilistic Proofs and Pseudorandomness , 1998, Algorithms and Combinatorics.

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

[15]  Moni Naor,et al.  Decision trees and downward closures , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[16]  Stephen A. Cook,et al.  Efficiently Approximable Real-Valued Functions , 2000, Electron. Colloquium Comput. Complex..

[17]  Neil Immerman,et al.  Sparse Sets in NP-P: EXPTIME versus NEXPTIME , 1985, Inf. Control..

[18]  Peter Bro Miltersen.  Derandomizing Complexity Classes , 2001 .

[19]  Dieter van Melkebeek,et al.  Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses , 1999, STOC '99.

[20]  Avi Wigderson,et al.  P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.

[21]  Avi Wigderson,et al.  Randomness vs. time: de-randomization under a uniform assumption , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[22]  Russell Impagliazzo,et al.  Decision versus search problems in super-polynomial time , 1989, 30th Annual Symposium on Foundations of Computer Science.

[23]  José D. P. Rolim,et al.  A new general derandomization method , 1998, JACM.

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

[25]  Valentine Kabanets,et al.  2 Better Tradeoffs 2 . 1 Hardness amplification via error-correcting codes , 2007 .

[26]  Boaz Barak,et al.  How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[27]  Oded Goldreich,et al.  Another proof that bpp?ph (and more) , 1997 .

[28]  Alexander A. Razborov,et al.  Natural Proofs , 2007 .

[29]  Amit Sahai,et al.  On the (im)possibility of obfuscating programs , 2001, JACM.