NP-hard sets are exponentially dense unless coNP ⊆ NP/poly

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2008, Pages 1-7

  Buhrman, Harry ^a,b   Hitchcock, John M ^c  

^a CWI   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

^c UNIVERSITY OF WYOMING   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES;

NP-HARD;

COMPUTATIONAL COMPLEXITY;

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

References (13)

1. E. Allender, L. A. Hemachandra, M. Ogiwara, and O. Watanabe. Relating equivalence and reducibility to sparse sets. SIAM Journal on Computing, 21(3):521-539, 1992.
2. L. Berman and H. Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM Journal on Computing, 6(2):305-322, 1977.
3. H. Buhrman and S. Homer. Superpolynomial circuits, almost sparse oracles and the exponential hierarchy. In Proceedings of the 12th Conference on Foundations of Software, Technology and Theoretical Computer Science, pages 116-127. Springer, 1992.
4. L. Fortnow and R. Santhanam. Infeasibility of instance compression and succinct PCPs for NP. In Proceedings of the 40th ACM Symposium on the Theory of Computing, 2008. To appear.
5. S. Fortune. A note on sparse complete sets. SIAM Journal on Computing, 8(3):431-433, 1979.
6. J. M. Hitchcock. Online learning and resource-bounded dimension: Winnow yields new lower bounds for hard sets. SIAM Journal on Computing, 36(6):1696-1708, 2007.
7. R. Kannan. Circuit-size lower bounds and non-reducibility to sparse sets. Information and Control, 55(1-3):40-56, 1982.
8. R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. In Proceedings of the 12th ACM Symposium on Theory of Computing, pages 302-309, 1980.
9. S. Mahaney. Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis. Journal of Computer and System Sciences, 25(2): 130-143, 1982.
10. A. Meyer and M. Paterson. With what frequency are apparently intractable problems difficult? Technical Report MIT/LCS/TM-126, M.I.T., 1979.
11. M. Ogiwara and O. Watanabe. On polynomialtime bounded truth-table reducibility of NP sets to sparse sets. SIAM Journal on Computing, 20(3):471-483, 1991.
12. P. Orponen, K-I Ko, U. Schöning, and O. Watanabe. Instance complexity. Journal of the ACM, 41(1):96-121, 1994.
13. C. K. Yap. Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science, 26(3):287-300, 1983.