skip to main content
10.1145/1250790.1250832acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article

Circuit lower bounds for Merlin-Arthur classes

Published:11 June 2007Publication History
First page image

References

  1. {1} Scott Aaronson. Oracles are subtle but not malicious. Electronic Colloquium on Computational Complexity, 12(40), 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. {2} Miklos Ajtai. ¿1 1-formulae on finite structures. Annals of Pure and Applied Logic, 24:1-48, 1983.Google ScholarGoogle ScholarCross RefCross Ref
  3. {3} Vikraman Arvind and Johannes Köbler. On pseudorandomness and resource-bounded measure. In Proceedings of 17th Conference on the Foundations of Software Technology and Theoretical Computer Science, pages 235-249. Springer, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. {4} Boaz Barak. A probabilistic-time hierarchy theorem for "Slightly Non-uniform" algorithms. Lecture Notes in Computer Science, 2483:194-208, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. {5} Nader Bshouty, Richard Cleve, Ricard Gavalda, Sampath Kannan, and Christino Tamon. Oracles and queries that are sufficient for exact learning. Journal of Computer and System Sciences, 52(2):268-286, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. {6} László Babai, Lance Fortnow, and Carsten Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1:3-40, 1991.Google ScholarGoogle ScholarCross RefCross Ref
  7. {7} Harry Buhrman, Lance Fortnow, and Thomas Thierauf. Nonrelativizing separations. In Proceedings of 13th Annual IEEE Conference on Computational Complexity, pages 8-12, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. {8} Theodore Baker, John Gill, and Robert Solovay. Relativizations of the P =? NP question. SIAM Journal on Computing, 4(4):431-442, 1975.Google ScholarGoogle ScholarCross RefCross Ref
  9. {9} Manuel Blum and Sampath Kannan. Designing programs that check their work. Journal of the Association for Computing Machinery, 42:269-291, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. {10} Jin-Yi Cai. S 2 p ¿ ZPP NP . In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, pages 620-629, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. {11} Jin-Yi Cai and Osamu Watanabe. On proving circuit lower bounds against the polynomial-time hierarchy. SIAM Journal on Computing, 33(4):984-1009, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  12. {12} Lance Fortnow and Rahul Santhanam. Hierarchy theorems for probabilistic polynomial time. In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pages 316-324, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. {13} Merrick Furst, James Saxe, and Michael Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17(1):13-27, April 1984.Google ScholarGoogle ScholarCross RefCross Ref
  14. {14} Oded Goldreich, Madhu Sudan, and Luca Trevisan. From logarithmic advice to single-bit advice. Electronic Colloquium on Computational Complexity, TR04-093, 2004.Google ScholarGoogle Scholar
  15. {15} Oded Goldreich and David Zuckerman. Another proof that BPP subseteq PH (and more). Electronic Colloquium on Computational Complexity, TR97-045, 1997.Google ScholarGoogle Scholar
  16. {16} Johan Håstad. Almost optimal lower bounds for small depth circuits. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pages 6-20, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. {17} Yenjo Han, Lane Hemaspaandra, and Thomas Thierauf. Threshold computation and cryptographic security. SIAM Journal on Computing, 26(1):59-78, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. {18} Russell Impagliazzo, Valentine Kabanets, and Avi Wigderson. In search of an easy witness: Exponential time vs. probabilistic polynomial time. Journal of Computer and System Sciences, 65(4):672-694, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. {19} Ravi Kannan. Circuit-size lower bounds and nonreducibility to sparse sets. Information and Control, 55(1):40-56, 1982.Google ScholarGoogle ScholarCross RefCross Ref
  20. {20} Valentine Kabanets and Russell Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity, 13(1-2):1-46, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. {21} Richard Karp and Richard Lipton. Turing machines that take advice. L'Enseignement Mathématique, 28(2):191-209, 1982.Google ScholarGoogle Scholar
  22. {22} Johannes Kobler and Osamu Watanabe. New collapse consequences of NP having small circuits. SIAM Journal on Computing, 28(1):311-324, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. {23} Carsten Lund, Lance Fortnow, Howard Karloff, and Noam Nisan. Algebraic methods for interactive proof systems. Journal of the Association for Computing Machinery, 39(4):859-868, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. {24} Noam Nisan and Avi Wigderson. Hardness vs randomness. Journal of Computer and System Sciences, 49(2):149-167, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. {25} Ryan O'Donnell. Hardness amplification within NP. Journal of Computer and System Sciences, 69(1):68-94, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. {26} Alexander Razborov. Lower bounds for the monotone complexity of some boolean functions. Soviet Mathematics Doklady, 31:354-357, 1985.Google ScholarGoogle Scholar
  27. {27} Alexander Razborov. Lower bounds on the size of bounded-depth networks over the complete basis with logical addition. Mathematical Notes of the Academy of Sciences of the USSR, 41(4):333-338, 1987.Google ScholarGoogle ScholarCross RefCross Ref
  28. {28} Alexander Razborov and Steven Rudich. Natural proofs. Journal of Computer and System Sciences, 55(1):24-35, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. {29} Alexander Russell and Ravi Sundaram. Symmetric alternation captures BPP. Computational Complexity, 7(2):152-162, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. {30} Rahul Santhanam. Circuit lower bounds for Merlin-Arthur classes. Electronic Cooloquium on Computational Complexity, TR07-005, 2007.Google ScholarGoogle Scholar
  31. {31} Adi Shamir. IP = PSPACE. Journal of the Association for Computing Machinery, 39(4):869-877, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. {32} Roman Smolensky. Algebraic methods in the theory of lower bounds for boolean circuit complexity. In Proceedings of the 19th Annual Symposium on Theory of Computing, pages 77-82, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. {33} Madhu Sudan, Luca Trevisan, and Salil Vadhan. Pseudorandom generators without the XOR lemma. Journal of Computer System Sciences, 62(2):236-266, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. {34} Seinosuke Toda. On the computational power of PP and ¿P. In 30th Annual IEEE Symposium on Foundations of Computer Science, pages 514-519, 1989.Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. {35} Luca Trevisan and Salil Vadhan. Pseudorandomness and average-case complexity via uniform reductions. In Proceedings of the 17th Annual IEEE Conference on Computational Complexity, volume 17, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. {36} Leslie Valiant. Completeness classes in algebra. In Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pages 249-261, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. {37} Leslie Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189-201, 1979.Google ScholarGoogle ScholarCross RefCross Ref
  38. {38} Nikolai Vereshchagin. On the power of PP. In Structure in Complexity Theory Conference, pages 138-143, 1992.Google ScholarGoogle ScholarCross RefCross Ref
  39. {39} Variyam Vinodchandran. A note on the circuit complexity of pp. Theoretical Computer Science, 347(1-2):415-418, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. {40} Christopher Wilson. Relativized circuit complexity. Journal of Computer and System Sciences, 31(2):169-181, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. {41} Andrew Yao. Theory and application of trapdoor functions. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pages 80-91, 1982.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Circuit lower bounds for Merlin-Arthur classes

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!