Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2010, Pages 38-49

  Gutfreund, Dan ^a   Kawachi, Akinori ^b  

^a IBM RESEARCH   (United States)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Approximate counting; Arthur Merlin protocols; Circuit complexity; Derandomization

Indexed keywords

APPROXIMATE COUNTING; ARTHUR-MERLIN GAMES; BOOLEAN CIRCUIT; CIRCUIT COMPLEXITY; CIRCUIT LOWER BOUNDS; CIRCUIT MODELS; COMPUTATIONAL LEARNING THEORY; DERANDOMIZATION; DERANDOMIZING; DETERMINISTIC LEARNING; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; HARD FUNCTION; LOWER BOUNDS; MULTIPLICATIVE FACTORS; NONDETERMINISTIC POLYNOMIAL; P-COMPLETE PROBLEM; POLYNOMIAL-TIME; PROMISE PROBLEMS; PSEUDORANDOM GENERATORS; RANDOMIZED ALGORITHMS; SPECIFIC TASKS;

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; EXPONENTIAL FUNCTIONS; POLYNOMIAL APPROXIMATION; TURING MACHINES;

LEARNING ALGORITHMS;

EID: 77955259661     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2010.13     Document Type: Conference Paper

References (33)

1. V. Arvind and P. Mukhopadhyay, "Derandomizing the isolation lemma and lower bounds for circuit size," in Proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2008) and the 12th International Workshop on Randomization and Computation (RANDOM 2008), ser. LNCS 5171, 2008, pp. 276-289.
2. A. Atserias, "Distinguishing SAT from polynomial-size circuits, through black-box queries," in Proceedings of the 21st Annual IEEE Conference on Computational Complexity, pp. 88-95, 2006.
3. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson, "BPP has subexponential simulation unless EXPTIME has publishable proofs," Computational Complexity, vol. 3, pp. 307-318, 1993.
4. L. Babai and S. Moran, "Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes," Journal of Computer and System Sciences, vol. 36, pp. 254-276, 1988.
5. M. Bellare, O. Goldreich, and E. Petrank, "Uniform generation of NP-witnesses using an NP-oracle," Information and Computation, vol. 163, pp. 510-526, 2000.
6. A. Bogdanov and L. Trevisan, "On worst-case to average-case reductions for NP problems," SIAM Journal on Computing, vol. 36, no. 4, pp. 1119-1159, 2006.
7. N. H. Bshouty, R. Cleve, R. Gavaldà, S. Kannan, and C. Tamon, "Oracles and queries that are sufficient for exact learning," Journal of Computer and System Sciences, vol. 52, no. 3, pp. 421-433, 1996.
8. H. Buhrman, L. Fortnow, and T. Thierauf, "Nonrelativizing separations," in Proceedings of the 13rd Annual IEEE Conference on Computational Complexity, 1998, pp. 8-12.
9. p via Arthur and Merlin," in Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2008, pp. 157-168.
10. Z. Dvir, A. Shpilka, and A. Yehudanoff, "Hardness-randomness tradeoffs for bounded depth arithmetic circuits," SIAM Journal on Computing, vol. 39, no. 4, pp. 1279-1293, 2009.
11. L. Fortnow, A. Pavan, and S. Sengupta, "Proving SAT does not have small circuits with an application to the two queries problem," Journal of Computer and System Sciences, vol. 74, no. 3, pp. 358-363, 2008.
12. M. Fürer, O. Goldreich, Y. Mansour, M. Sipser, and S. Zachos, "On completeness and soundness in interactive proof systems," Advances in Computing Research 5: Randomness and Computation, pp. 429-442, 1989.
13. S. Goldwasser, S. Micali, and C. Rackoff, "The knowledge complexity of interactive proof systems," SIAM Journal on Computing, vol. 18, no. 1, pp. 186-208, 1989.
14. S. Goldwasser and M. Sipser, "Private coins versus public coins in interactive proof system," in Advances in Computing Research, Vol. 5: Randomness and Computation, S. Micali, Ed. JAI Press, 1989, pp. 73-90.
15. R. Impagliazzo, V. Kabanets, and A. Wigderson, "In search of an easy witness: exponential time vs. probabilistic polynomial time," Journal of Computer and System Sciences, vol. 65, no. 4, pp. 672-694, 2002.
16. 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 Theory of Computing, 1997, pp. 220-229.
17. M. R. Jerrum, L. G. Valiant, and V. V. Vazirani, "Random generation of combinatorial structures from a uniform distribution," Theoretical Computer Science, vol. 43, pp. 169-188, 1986.
18. V. Kabanets and R. Impagliazzo, "Derandomizing polynomial identity tests means proving circuit lower bounds," Computational Complexity, vol. 13, no. 1-2, pp. 1-46, 2004.
19. R. Kannan, "Circuit-size lower bound and non-reducibility to sparse sets," Information and Control, vol. 55, no. 1-3, pp. 40-56, 1982.
20. R. M. Karp and R. J. Lipton, "Some connections between nonuniform and uniform complexity classes," in Proceedings of the 12th Annual Symposium on Theoretical Computer Science, 1980, pp. 302-309.
21. J. Kinne, D. van Melkebeek, and R. Shaltiel, "Pseudorandom generators and typically-correct derandomization," in Proceedings of the 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2009) and the 13th International Workshop on Randomization and Computation (RANDOM 2009), 2009, pp. 574-587.
22. A. R. Klivans and D. van Melkebeek, "Graph nonisomorphism has subexponential size proofs unless the polynomialtime hierarchy collapses," SIAM Journal on Computing, vol. 31, no. 5, pp. 1501-1526, 2002.
23. J. Köbler and O. Watanabe, "New collapse consequences of NP having small circuits," SIAM Journal on Computing, vol. 28, no. 1, pp. 311-324, 1998.
24. P. B. Miltersen and N. V. Vinodchandran, "Derandomizing Arthur-Merlin games using hitting sets," Computational Complexity, vol. 14, no. 3, pp. 256-279, 2005.
25. P. B. Miltersen, N. V. Vinodchandran, and O. Watanabe, "Super-polynomial versus half-exponential circuit size in the exponential hierarchy," in Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON), 1999, pp. 210-220.
26. N. Nisan, "Pseudorandom bits for constant depth circuits," Combinatorica, vol. 11, pp. 63-70, 1991.
27. R. Santhanam, "Circuit lower bounds for Merlin-Arthur classes," in Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007, pp. 275-283.
28. R. Shaltiel and C. Umans, "Simple extractors for all minentropies and a new pseudo-random generator," Journal of ACM, vol. 52, no. 2, pp. 172-216, 2005.
29. R. Shaltiel and C. Umans, "Pseudorandomness for approximate counting and sampling," Computational Complexity, vol. 15, no. 4, pp. 298-341, 2006.
30. L. J. Stockmeyer, "The complexity of approximate counting," in Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 118-126.
31. S. Toda, "On the computational power of PP and ⊕P," in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 514-519.
32. C. Umans, "Pseudo-random generators for all hardnesses," Journal of Computer and System Sciences, vol. 67, no. 2, pp. 419-440, 2003.
33. E. Viola, "Pseudorandom bits for constant-depth circuits with few arbitrary symmetric gates," SIAM Journal on Computing, vol. 36, no. 5, pp. 1387-1403, 2007.