Holographic proofs and derandomization

SIAM Journal on Computing

Volumn 35, Issue 1, 2006, Pages 59-90

  Van Melkebeek, Dieter ^a   Santhanam, Rahul ^b  

^a University of Wisconsin   (United States)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

Arthur Merlin games; Derandomization; Holographic proofs

Indexed keywords

ARTHUR-MERLIN GAMES; DERANDOMIZATION; HOLOGRAPHIC PROOFS;

CODES (SYMBOLS); COMPUTER SIMULATION; ERROR CORRECTION; POLYNOMIALS; PROBABILISTIC LOGICS;

HOLOGRAPHY;

EID: 33644589815     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703438629     Document Type: Article

References (40)

1. 0, Fundamentals of Computation Theory, 8 (1991), pp. 1-15.
2. 1-formulae on finite structures, Ann. Pure Appl. Logic, 24 (1983), pp. 1-48.
3. [AKS02] M. AGRAWAL, N. KAYAL, AND N. SAXENA, PRIMES is in P, Technical report, Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India, 2002.
4. [BDG88] J. L. BALCÁZAR, J. DÍAZ, AND J. GABARRÓ, Structural Complexity 1, Springer-Verlag, New York, 1988.
5. [BDG90] J. L. BALCÁZAR, J. DÍAZ, AND J. GABARRÓ, Structural Complexity 2, Springer-Verlag, New York, 1990.
6. [BFL91] L. BABAI, L. FORTNOW, AND C. LUND, Non-deterministic exponential time has two-prover interactive protocols, Comput. Complexity, 1 (1991), pp. 3-40.
7. [BFLS91] L. BABAI, L. FORTNOW, L. A. LEVIN, AND M. SZEGEDY, Checking computations in polylogarithmic time, in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, New Orleans, LA, 1991, ACM, New York, pp. 21-32.
8. [BFNW93] L. BABAI, L. FORTNOW, N. NISAN, AND A. WIGDERSON, BPP has subexponential time simulations unless EXPTIME has publishable proofs, Comput. Complexity, 3 (1993), pp. 307-318.
9. [BM84] M. BLUM AND S. MICALI, How to generate cryptographically strong sequence of pseudorandom bits, SIAM J. Comput., 13 (1984), pp. 850-864.
10. [BM88] L. BABAI AND S. MORAN, Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes, J. Comput. System Sci., 36 (1988), pp. 254-276.
11. [BYGW99] Z. BAR-YOSSEF, O. GOLDREICH, AND A. WIGDERSON, Deterministic amplification of space-bounded probabilistic algorithms, in Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Los Alamitos, NV, 1999, IEEE Computer Society, Piscataway, NJ, pp. 188-199.
12. [CW89] A. COHEN AND A. WIGDERSON, Dispersers, deterministic amplification, and weak random sources, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, Chapel Hill, NC, 1989, IEEE Press, Piscataway, NJ, pp. 14-19.
13. [FSS84] M. FURST, J. B. SAXE, AND M. SIPSER, Parity, circuits, and the polynomial-time hierarchy, Math. Systems Theory, 17 (1984), pp, 13-27.
14. [GHS91] J. G. GESKE, D. T. HUYNH, AND J. I. SEIFERAS, A note on almost-everywhere-complex sets and separating deterministic-time-complexity classes, Inform, and Comput., 92 (1991), pp. 97-104.
15. [Go100] O. GOLDREICH, Pseudorandomness, in Annual International Colloquium on Automata, Languages and Programming, 2000, pp. 687-704.
16. [GW02] O. GOLDREICH AND A. WIGDERSON, Derandomization that is rarely wrong from short advice that is typically good, in Proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science, Cambridge, MA, 2002, pp. 209-223.
17. [Hås86] J. HÅSTAD, Almost optimal lower bounds for small depth circuits, in Proceedings of the 18th Annual ACM Symposium on Theory of Computing, Berkeley, CA, 1986, ACM, New York, pp. 6-20.
18. [He186] H. HELLER, On relativized exponential and probabilistic complexity classes, Inform. and Control, 71 (1986), pp. 231-243.
19. [HR00] T. HARTMAN AND R. RAZ, On the distribution of the number of roots of polynomials and explicit logspace extractors, in Proceedings of the 4th International Workshop on Randomization and Approximation Techniques in Computer Science, Geneva, Switzerland, 2000, pp. 3-22.
20. [IKW02] R. IMPAGLIAZZO, V. KABANETS, AND A. WIGDERSON, In search of an easy witness: Exponential time vs. probabilistic polynomial time, 3. Comput. System Sci., 65 (2002), pp. 672-694.
21. [INW94] R. IMPAGLIAZZO, N. NISAN, AND A. WIGDERSON, Pseudorandomness for network algorithms, in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, Montreal, QC, 1994, ACM, New York, pp. 356-364.
22. [IW97] R. IMPAGLIAZZO AND A. WIGDERSON, P = BPP if E requires exponential circuits: Derandomizing the XOR lemma, in Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, El Paso, TX, 1997, ACM, New York, pp. 220-229.
23. [IW01] R. IMPAGLIAZZO AND A. WIGDERSON, Randomness vs. time: Derandomization under a uniform assumption, J. Comput. System Sci., 63 (2001), pp. 672-688.
24. [IZ89] R. IMPAGLIAZZO AND D. ZUCKERMAN, How to recycle random bits, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, Research Triangle Park, NC, 1989, IEEE Press, Piscataway, NJ, pp. 248-253.
25. [Kab01] V. KABANETS, Easiness assumptions and hardness tests: Trading time for zero error, J. Comput. System Sci., 63 (2001), pp. 236-252.
26. [KI03] V. KABANETS AND R. IMPAGLIAZZO, Derandomizing polynomial identity tests means proving circuit lower bounds, J. Comput. Complexity, 13 (2004), pp. 1-46.
27. [KL82] R. KARP AND R. LIPTON, Turing machines that take advice, L'Enseignement Mathématique, 28 (1982), pp. 191-209.
28. [KPS85] R. KARP, N. PIPPENGER, AND M. SIPSER, A time randomness tradeoff, in Proceedings of the AMS Conference on Probabilistic Computational Complexity, Durham, NH, 1985.
29. [KV96] M. KARPINSKI AND R. VERBEEK, On randomized versus deterministic computation, Theoret. Comput. Sci., 154 (1996), pp. 23-39.
30. [KvM02] A. R. KLIVANS AND D. VAN MELKEBEEK, Graph nonisomorphism has subexponential size proofs unless the polynomial hierarchy collapses, SIAM J. Comput., 31 (2002), pp. 1501-1526.
31. [Lu01] C.-J. LU, Derandomizing Arthur-Merlin games under uniform assumptions, Comput. Complexity, 10 (2001), pp. 247-259.
32. [NW94] N. NISAN AND A. WIGDERSON, Hardness vs. randomness, J. Comput. System Sci., 49 (1994), pp. 149-167.
33. [NZ96] N. NISAN AND D. ZUCKERMAN, Randomness is linear in space, J. Comput. System Sci., 52 (1996), pp. 43-52.
34. [Sha02] R. SHALTIEL, Recent developments in explicit constructions of extractors, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 77 (2002), pp. 67-95.
35. [Sip88] M. SIPSER, Expanders, randomness, or time versus space, J. Comput. System Sci., 36 (1988), pp. 379-383.
36. [SSZ98] M. SAKS, A. SRINIVASAN, AND S. ZHOU, Explicit OR-dispersers with polylogarithmic degree, J. ACM, 45 (1998), pp. 123-154.
37. [SU01] R. SHALTIEL AND C. UMANS, Simple extractors for all min-entropies and a new pseudorandom generator, in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, Las Vegas, NV, 2001, IEEE Press, Piscataway, NJ, pp. 648-657.
38. [SvM03] R. SANTHANAM AND D. VAN MELKEBEEK, Holographic proofs and derandomization, in Proceedings of the 18th Annual IEEE Conference on Computational Complexity, Aarhus, Denmark, 2003, IEEE Press, Piscataway, NJ, pp. 269-283.
39. [vL98] J. H. VAN LINT, Introduction to Coding Theory, Springer-Verlag, Berlin, 1998.
40. [Yao82] A. YAO, Theory and application of trapdoor functions, in Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, Chicago, 1982, IEEE Press, Piscataway, NJ, pp. 80-91.