NP with small advice

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2005, Pages 228-234

  Fortnow, Lance ^a   Klivans, Adam R ^b  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPONENTIAL TIME; UNIFORM COMPLEXITY;

POLYNOMIALS;

COMPUTATIONAL COMPLEXITY;

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

References (29)

1. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, 1991.
2. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential simulations unless EXPTIME has publishable proofs. Computational Complexity, 3:307-318, 1993.
3. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Springer, 1988.
4. B. Barak. A probabilistic-time hierarchy theorem for "Slightly Non-uniform" algorithms. In Proceedings of Randomization and Approximation Techniques: 6th International Workshop, volume 2483, pages 194-208. Springer, Berlin, 2002.
5. H. Buhrman. Personal Communication.
6. H. Buhrman, R. Chang, and L. Fortnow. One bit of advice. In Proceedings of the 20th Symposium on Theoretical A spects of Computer Science, volume 2607 of Lecture Notes in Computer Science, pages 547-558. Springer, Berlin, 2003.
7. H. Buhrman, L. Fortnow, and A. Pavan. Some results on derandomization. In Proceedings of the 20th Symposium on Theoretical Aspects of Computer Science, volume 2607 of Lecture Notes in Computer Science, pages 212-222. Springer, Berlin, 2003.
8. H. Buhrman and S. Homer. Superpolynomial circuits, almost sparse oracles and the exponential hierarchy. In Proceedings of the 12th Conference on the Foundations of Software Technology and Theoretical Computer Science, volume 652 of Lecture Notes in Computer Science, pages 116-127. Springer, Berlin, Germany, 1992.
9. A. Chandra, D. Kozen, and L. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, 1981.
10. th IEEE Symposium on Foundations of Computer Science, pages 316-324. IEEE, New York, 2004.
11. B. Fu, H. Li, and Y. Zhong. An application of the translational method. Mathematical Systems Theory, 27:183-186, 1994.
12. D. Gutfreund, R. Shaltiel, and A. Ta-Shma. Uniform hardness vs. randomness tradeoffs for arthur-merlin games. In Proceedings of the 18th IEEE Conference on Computational Complexity, pages 33-47. IEEE, New York, 2003.
13. R. Impagliazzo, V. Kabanets, and A. Wigderson. In search of an easy witness: Exponential versus probabilistic time. Journal of Computer and System Sciences, 65(4):672-694, 2002.
14. V. Kabanets. Derandomization: A brief overview. Bulletin of the European Association for Theoretical Computer Science, 76, Feb. 2002.
15. V. Kabanets and R. Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. In Proceedings of the 35th ACM Symposium on the Theory of Computing, pages 355-364, New York, 2003. ACM.
16. R. Kannan. Circuit-size lower bounds and non-reducibility to sparse sets. Information and Control, 55:40-56, 1982.
17. R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. In Proceedings of the 12th A CM Symposium on the Theory of Computing, pages 302-309. ACM, New York, 1980.
18. A. Klivans and D. van Melkebeek. Graph nonisomorhism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM Journal on Computing, 31(5):1501-1526, 2002.
19. M. Krentel. The complexity of optimization problems. Journal of Computer and System Sciences, 36(3):490-509, June 1988.
20. C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems. Journal of the ACM, 39(4):859-868, 1992.
21. P. Miltersen and V. Vinodchandran. Derandomizing Arthur-Merlin games using hitting sets. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pages 71-80. IEEE, New York, 1999.
22. N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
23. S. Roy. Personal Communication.
24. R. Shaltiel and C. Umans. Simple extractors for all minentropies and a new pseudo-random generator. In IEEE, editor, 42nd IEEE Symposium on Foundations of Computer Science: proceedings: October 14-17, 2001, Las Vegas, Nevada, USA, pages 648-657, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 2001. IEEE Computer Society Press.
25. R. Shaltiel and C. Umans. Pseudorandomness for approximate counting and sampling. In Proceedings of the 20th IEEE Conference on Computational Complexity. IEEE, New York, 2005. These proceedings.
26. S. Toda. PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing, 20(5):865-877, 1991.
27. L. Trevisan and S. Vadhan. Pseudorandomness and average-case complexity via uniform reductions. In Proceedings of the 17th IEEE Conference on Computational Complexity, pages 103-112. IEEE, New York, 2002.
28. L. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189-201, 1979.
29. C. Yap. Some consequences of nonuniform conditions on uniform classes. Theoretical Computer Science, 26:287-300, 1983.