Finding irrefutable certificates for S2p via Arthur and Merlin

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 157-168

  Chakaravarthy, Venkatesan T ^a   Roy, Sambuddha ^a  

^a IBM RESEARCH INDIA   (India)

Author keywords

Karp Lipton theorem; Learning circuits; Promise AM; Symmetric alternation

Indexed keywords

POLYNOMIAL APPROXIMATION;

KARP-LIPTON THEOREM; LEARNING CIRCUIT; POLYNOMIAL SIZE; POLYNOMIAL-TIME HIERARCHY; PRAM ALGORITHMS; SYMMETRIC ALTERNATION;

POLYNOMIALS;

EID: 45749121914     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. V. Arvind and J. Köbler. On pseudorandomness and resource-bounded measure. In Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science, 1997.
2. V. Arvind, J. Köbler, U. Schöning, and R. Schuler. If NP has polynomial-size circuits, then MA=AM. Theoretical Computer Science, 137(2):279-282, 1995.
3. L. Babai and S. Moran. Arthur-merlin games: A randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences, 36(2):254-276, 1988.
4. N. 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, 52(3):421-433, 1996.
5. NP. Journal of Computer and System Sciences, 73(1), 2007.
6. R. Canetti. More on BPP and the polynomial-time hierarchy. Information Processing Letters, 57(5):237-241, 1996.
7. V. Chakaravarthy and S. Roy. Oblivious symmetric alternation. In Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, 2006.
8. D. Du and K. Ko. Computational Complexity. John Wiley and sons, 2000.
9. L. Fortnow, R. Impagliazzo, V. Kabanets, and C. Umans. On the complexity of succinct zero-sum games. In Proceedings of the 20th Annual IEEE Conference on Computational Complexity, 2005.
10. O. Goldreich and A. Wigderson. Improved derandomization of BPP using a hitting set generator. In RANDOM-APPROX, 1999.
11. O. Goldreich and D. Zuckerman. Another proof that BPP C PH (and more). Technical Report TR97-045, ECCC, 1997.
12. M. Jerrum, L. Valiant, and V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science, 43, 1986.
13. R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. In Proceedings of the 12th ACM Symposium on Theory of Computing, 1980.
14. J. Köbler and O. Watanabe. New collapse consequences of NP having small circuits. SIAM Journal on Computing, 28(1):311-324, 1998.
15. P. Miltersen and N. Vinodchandran. Derandomizing Arthur-Merlin games using hitting sets. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, 1999.
16. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
17. A. Russell and R. Sundaram. Symmetric alternation captures BPP. Computational Complexity, 7(2): 152-162, 1998.
18. R. Santhanam. Circuit lower bounds for Merlin-Arthur classes. In Proceedings of the 39th ACM Symposium on Theory of Computing, 2007.
19. R. Shaltiel and C. Umans. Pseudorandomness for approximate counting and sampling. Computational Complexity, 15(4), 2007.
20. M. Sipser. A complexity theoretic approach to randomness. In Proceedings of the 15th ACM Symposium on Theory of Computing, 1983.
21. L. Stockmeyer. The complexity of approximate counting. In Proceedings of the 15th ACM Symposium on Theory of Computing, 1983.