Separating NP-completeness notions under strong hypotheses

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1997, Pages 121-127

  Ambos Spies, K ^a   Bentzien, L ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BAIRE CATEGORY; NP-COMPLETENESS; RESOURCE-BOUNDED; RESOURCE-BOUNDED MEASURE;

COMPUTATIONAL COMPLEXITY;

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

References (19)

1. K Ambos-Spies. Resource-bounded genericity. In Cooper kt al., editors, Computability, Enumerability, Unsolvability: birections in Recursion Theory, London Math. Soc. Lect. Notes Series 224, pages 1-59. Cambridge University Press, 1996.
2. K. Ambos-Spies, H. Fleischhack, and H. Huwig. Diago-nalizing over deterministic polynomial time. In Proceed-ingsof the First Workshop on Computer Science Logic, CSL87, Lecture Notes in Computer Science 329, pages 1-16, springer Verlag, 1988.
3. IK. 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 187, pages 1 4 7. Marcel Dekker, 1997.
4. KA. mbos-Spies, H.-C. Neis, and S. A. Terwijn. Genericity land measure for exponential time. Theoretical Computer science, 168, 3-19, 1996.
5. KA. mbos-Spies, S. A. Terwijn, and X. Zheng. Resource bounded randomness and weakly complete problems. The-!oretical Computer Science, 172, 195-207, 1997.
6. JL. Berman. On the structure of complete sets: Almost every-where complexity and infinitely often speedup. In Proceedl ings of the Seventeenth Annual Conference on Foundations of Computer Science, pages 76-80, IEEE Computer Society press, 1991.
7. H. Buhrmann and L. Torenvliet. On the structure of complete sets. In Proceedings of the Ninth Annual Structure in Complexity Theory Conference, pages 118-133, IEEE Computer Society Press, 1994.
8. I S. A. Fenner. Notions of resource-bounded category and genericity. In Proceedings of the Sixth Annual Structure in Complexity Theory Conference, pages 196-212, IEEE Com-1 puter Society Press, 1991.
9. S. A. Fenner. Resource-bounded category: A stronger approach. In Proceedings of the Tenth Annual Structure in Complexity Theory Conference, pages 182-192, IEEE Computer Society Press, 1995.
10. S. Homer, S. Kurtz, and J. Royer. A note on 1-truth-table complete sets. Theoretical Computer Science, 115, 383-389, 1993.
11. 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.
12. R. Ladner. On the structure of polynomial time reducibility. Journalof the ACM, 22, 155-171, 1975.
13. R. Ladner, N. Lynch, and A. Selman. A comparison of polynomial-time reducibilities. Theoretical Computer Science, 1, 103-123, 1975.
14. J. H. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences, 44, 220-258, 1992.
15. J. H. Lutz. The quantitative structure of exponential time. In Proceedings of the Eighth Annual Conference on Structure in Complexity Theory, pages 158-175, IEEE Computer Society Press, 1993.
16. J. H. Lutz. The quantitative structure of exponential time. In L. A. Hemaspaandra and A. L. Selman, editors, Complexity Theory Retrospective, ZZ. Springer Verlag, (to appear).
17. 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.
18. S. R. Mahaney. Sparse complete sets for NP: Solution for a conjecture of Berman and Hartmanis. Journal of Computer and System Sciences, 25, 130-143, 1982.
19. U. Schoning. A uniform approach to obtain diagonal sets in complexity classes. Theoretical Computer Science, 18, 95-103, 1982.