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

Journal of Computer and System Sciences

Volumn 65, Issue 4, 2002, Pages 672-694

  Impagliazzo, Russell ^a   Kabanets, Valentine ^a,d   Wigderson, Avi ^b,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

^d UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; SPECTRUM ANALYSIS;

EXPONENTIAL TIME; LINEAR FUNCTIONS; POLYNOMIAL TIMES; TRADEOFFS;

POLYNOMIALS;

EID: 23844442856     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(02)00024-7     Document Type: Conference Paper

References (30)

1. [ACR98] A.E. Andreev, A.E.F. Clementi, J.D.P. Rolim, A new general derandomization method, J. Assoc. Comput. Mach. 45 (1) (1998) 179-213 (preliminary version in ICALP'96).
2. [Bab85] L. Babai, Trading group theory for randomness, in: Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985, pp. 421-429.
3. [BFL91] L. Babai, L. Fortnow, C. Lund, Non-deterministic exponential time has two-prover interactive protocols, Comput. Complexity 1 (1991) 3-40.
4. [BFNW93] L. Babai, L. Fortnow, N. Nisan, A. Wigderson, BPP has subexponential time simulations unless EXPTIME has publishable proofs, Complexity 3 (1993) 307-318.
5. [BM88] L. Babai, S. Moran, Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes, J. Comput. System Sci. 36 (1988) 254-276.
6. [Bar01] B. Barak, How to go beyond the black-box simulation barrier, in: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 106-115.
7. [BGI01] B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, K. Yang, On the (im)possibility of obfuscating programs, in: J. Kilian (Ed.), Advances in Cryptology - CRYPTO'2001, Lecture Notes in Computer Science, Vol. 2139, Springer, Berlin, Germany, 2001, pp. 1-18.
8. [BFT98] H. Buhrman, L. Fortnow, L. Thierauf, Nonrelativizing separations, in: Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1988, pp. 8-12.
9. [BH92] H. Buhrman, S. Homer, Superpolynomial circuits, almost sparse oracles and the exponential hierarchy, in: R. Shyamasundar (Ed.), Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 652, Springer, Berlin, Germany, 1992, pp. 116-127.
10. [For01] L. Fortnow, Comparing notions of full derandomization, in: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001, pp. 28-34.
11. [Go199] O. Goldreich, Modern Cryptography, Probabilistic Proofs and Pseudorandomness, Algorithms and Combinatorics Series, Vol. 17, Springer, Berlin, 1999.
12. [GZ97] O. Goldrcich, D. Zuckerman, Another proof that BPP ⊂ PH (and more), Electronic Colloquium on Computational Complexity, TR97-045, 1997.
13. [HIS85] J. Hartmanis, N. Immerman, V. Sewelson, Sparse sets in NP-P: EXPTIME versus NEXPTIME, Inform. Control 65 (1985) 158-181.
14. [IN88] R. Impagliazzo, M. Naor, Decision trees and downward closures, in: Proceedings of the 3rd Annual IEEE Conference on Structure in Complexity Theory, 1988, pp. 29-38.
15. [IT89] R. Impagliazzo, G. Tardos, Decision versus search problems in super-polynomial time, in: Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 222-227.
16. [IW97] R. Impagliazzo, A. Wigderson. P = BPP if E requires exponential circuits: derandomizing the XOR Lemma, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 220-229.
17. [IW98] R. Impagliazzo, A. Wigderson, Randomness vs time: de-randomization under a uniform assumption, in: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 1998, pp. 734-743.
18. [Kab01] V. Kabanets, Easiness assumptions and hardness tests: trading time for zero error, J. Comput. System Sci. 63 (2) (2001) 236-252 (preliminary version in CCC'00).
19. [Kab02] V. Kabanets, Derandomization: a brief overview, Bull. Eur. Assoc. Theoret. Comput. Sci. 76 (2002) 88-103 (also available as ECCC TR02-008).
20. [KRC00] V. Kabanets, C. Rackoff, S. Cook, Efficiently approximable real-valued functions, Electronic Colloquium on Computational Complexity, TR00-034, 2000.
21. [KL82] R.M. Karp, R.J. Lipton, Turing machines that take advice, L'Enseignement Math. 28 (3-4) (1982) 191-209 (preliminary version in STOC'80).
22. [KM99] A. Klivans, D. van Melkebeek, Graph nonisomorphism has subexponential size proofs unless the polynomial hierarchy collapses, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 659-667.
23. [Lu01] C.-J. Lu, Derandomizing Arthur-Merlin games under uniform assumptions, Comput. Complexity 10 (3) (2001) 247-259 (preliminary version in ISAAC'00).
24. [Mil01] P.B. Miltersen, Drandomizing complexity classes, in: S. Rajasekaran, P. Pardalos, J. Reif, J. Rolim (Eds.), Handbook of Randomized Computing, Vol. II, Kluwer Academic Publishers, Dordrecht, 2001 (a draft is available at www.brics.dk/~bromille).
25. [MV99] P.B. Miltersen, N.V. Vinodchandran, Derandomizing Arthur-Merlin games using hitting sets, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, pp. 71-80.
26. [NW94] N. Nisan, A. Wigderson, Hardness vs. randomness, J. Comput. System Sci. 49 (1994) 149-167.
27. [Pap94] C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
28. [RR97] A.A. Razborov, S. Rudich, Natural proofs, J. Comput. System Sci. 55 (1997) 24-35.
29. [STV99] M. Sudan, L. Trevisan, S. Vadhan, Pseudorandom generators without the XOR lemma, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 537-546.
30. [Yao82] A.C. Yao, Theory and applications of trapdoor functions, in: Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, 1982, pp. 80-91.