Hardness hypotheses, derandomization, and circuit complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3328, Issue , 2004, Pages 336-347

  Hitchcock, John M ^a   Pavan, A ^b  

^a UNIVERSITY OF WYOMING   (United States)

^b Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; SOFTWARE ENGINEERING;

CIRCUIT COMPLEXITY; CIRCUIT SIZE; DERANDOMIZATION; LOW BOUND; NO 2; TIME MACHINE; LOWER BOUNDS;

TIMING CIRCUITS;

EID: 34247182542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30538-5_28     Document Type: Article

References (27)

1. E. Allender. When the worlds collide: derandomization, lower bounds and kolmogorov complexity. In Foundations of Software Technology and Theoretical Computer Science, pages 1-15. Springer-Verlag, 2001.
2. E. Allender and M. Strauss. Measure on small complexity classes with applications for BPP. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 807-818. IEEE Computer Society, 1994.
3. K. Ambos-Spies and E. Mayordomo. Resource-bounded measure and randomness. In A. Sorbi, editor, Complexity, Logic and Recursion Theory, Lecture Notes in Pure and Applied Mathematics, pages 1-47. Marcel Dekker, New York, N.Y., 1997.
4. J. Balcázar and U. Schöning. Bi-immune sets for complexity classes. Mathematical Systems Theory, 18(1):1-18, 1985.
5. N. Bshouty, R. Cleve, S. Kannan, R. Gavalda, and C. Tamon. Oracles and queries that are sufficient for exact learning. Journal of Computer and System Sciences, 52:421-433, 1996.
6. S. Fenner, L. Fortnow, A. Naik, and J. Rogers. Inverting onto functions. Information and Computation, 186(1):90-103, 2003.
7. C. Glaßer, A. Pavan, A. L. Selman, and S. Sengupta. Properties of NP-complete sets. In Proceedings of the 19th IEEE Conference on Computational Complexity, pages 184-197. IEEE Computer Society, 2004.
8. L. A. Hemaspaandra, J. Rothe, and G. Wechsung. Easy sets and hard certificate schemes. Acta Informatica, 34(11):859-879, 1997.
9. J. M. Hitchcock. Small spans in scaled dimension. SIAM Journal on Computing. To appear.
10. J. M. Hitchcock. MAX3SAT is exponentially hard to approximate if NP has positive dimension. Theoretical Computer Science, 289(1):861-869, 2002.
11. J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. Scaled dimension and nonuniform complexity. Journal of Computer and System Sciences, 69(2):97-122, 2004.
12. 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, 65:672-694, 2002.
13. R. Impagliazzo and P. Moser. A zero-one law for RP. In Proceedings of the 18th IEEE Conference on Computational Complexity, pages 43-47. IEEE Computer Society, 2003.
14. R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 220-229, 1997.
15. V. Kabanets. Easiness assumptions and hardness tests: Trading time for zero error. Journal of Computer and System Sciences, 63:236-252, 2001.
16. V. Kabanets. Derandomization: A brief overview. Bulletin of the EATCS, 76:88-103, 2002.
17. R. Kannan. Circuit-size lower bounds and non-reducibility to sparse sets. Information and Control, 55:40-56, 1982.
18. A. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM Journal on Computing, 31:1501-1526, 2002.
19. J. Köhler and O. Watanabe. New collapse consequences of NP having small circuits. SIAM Journal on Computing, 28(1):311-324, 1998.
20. C.-J. Lu. Derandomizing Arthur-Merlin games under uniform assumptions. Computational Complexity, 10(3):247-259, 2001.
21. J. H. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences, 44(2):220-258, 1992.
22. P. Theory of Computing Systems, 30(4):429-442, 1997.
23. J. H. Lutz. The quantitative structure of exponential time. In L. A. Hemaspaandra and A. L. Selman, editors, Complexity Theory Retrospective II, pages 225-260. Springer-Verlag, New York, 1997.
24. J. H. Lutz and E. Mayordomo. Measure, stochasticity, and the density of hard languages. SIAM Journal on Computing, 23(4):762-779, 1994.
25. J. H. Lutz and E. Mayordomo. Cook versus Karp-Levin: Separating completeness notions if NP is not small. Theoretical Computer Science, 164:141-163, 1996.
26. P. B. Miltersen. Derandomizing complexity classes. In Handbook of Randomized Computing, volume II, pages 843-934. Kluwer, 2001.
27. A. Pavan and A. L. Selman. Separation of NP-completeness notions. SIAM Journal on Computing, 31(3):906-918, 2002.