Separating NP-completeness notions under strong hypotheses

Journal of Computer and System Sciences

Volumn 61, Issue 3, 2000, Pages 335-361

  Ambos Spies, Klaus ^a   Bentzien, Levke ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

THEOREM PROVING;

BOUNDED QUERY REDUCIBILITIES;

COMPUTATIONAL COMPLEXITY;

EID: 0034514733     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1674     Document Type: Article

References (21)

1. Ambos-Spies K. Resource-bounded genericity. Cooper. Computability, Enumerability, Unsolvability: Directions in Recursion Theory. London Math. Soc. Lect. Notes Series. 224:1996;1-59 Cambridge University Press, Cambridge.
2. Ambos-Spies K., Fleischhack H., Huwig H. Diagonalizing over deterministic polynomial time. Proceedings of the First Workshop on Computer Science Logic, CSL '87. Lecture Notes in Computer Science. 329:1988;Springer-Verlag, Berlin. p. 1-16.
3. Ambos-Spies K., Mayordomo E. Resource-bounded measure and randomness. Sorbi A. Complexity, Logic and Recursion Theory. Lecture Notes in Pure and Applied Mathematics. 187:1997;1-47 Dekker, New York.
4. Ambos-Spies K., Neis H.-C., Terwijn S. A. Genericity and measure for exponential time. Theoret. Comput. Sci. 168:1996;3-19.
5. Ambos-Spies K., Terwijn S. A., Zheng X. Resource bounded randomness and weakly complete problems. Theoret. Comput. Sci. 172:1997;195-207.
6. Bellare M., Goldwasser S. The complexity of decision versus search. SIAM J. Comput. 23:1994;97-119.
7. Berman L. On the structure of complete sets: Almost everywhere complexity and infinitely often speedup. Proceedings of the Seventeenth Annual Conference on Foundations of Computer Science. 1976;IEEE Computer Society Press, Los Alamitos. p. 76-80.
8. Buhrman H., Torenvliet L. On the structure of complete sets. Proceedings of the Ninth Annual Structure in Complexity Theory Conference. 1994;IEEE Computer Society Press, Los Alamitos. p. 118-133.
9. Fenner S. A. Resource-bounded category: a stronger approach. Proceedings of the Tenth Annual Structure in Complexity Theory Conference. 1995;IEEE Computer Society Press, Los Alamitos. p. 182-192.
10. Homer S., Kurtz S., Royer J. A note on 1-truth-table complete sets. Theor. Comput. Sci. 115:1993;383-389.
11. Karp R., Lipton R. Some connections between nonuniform and uniform complexity classes. Proceedings of the 12th ACM Symposium on Theory of Computing. 1980;. p. 302-309.
12. Ladner R. On the structure of polynomial time reducibility. J. Assoc. Comput. Mach. 22:1975;155-171.
13. Ladner R., Lynch N., Selman A. A comparison of polynomial-time reducibilities. Theor. Comput. Sci. 1:1975;103-123.
14. Lutz J. H. Almost everywhere high nonuniform complexity. J. Comput. System Sci. 44:1992;220-258.
15. Lutz J. H. The quantitative structure of exponential time. Proceedings of the Eight Annual Conference on Structure in Complexity Theory. 1993;IEEE Computer Society Press, Los Alamitos. p. 158-175.
16. Lutz J. H. The quantitative structure of exponential time. Hemaspaandra L. A., Selman A. L. Complexity Theory Retrospective, II. 1997;Springer-Verlag, Berlin/New York.
17. Lutz J. H., Mayordomo E. Cook versus Karp-Levin: Separating completeness notions if NP is not small. Theoret. Comput. Sci. 164:1996;141-163.
18. Mahaney S. R. Sparse complete sets for NP: Solution for a conjecture of Berman and Hartmanis. J. Comput. System Sci. 25:1982;130-143.
19. Mayordomo E. Contributions to the Study of Resource-Bounded Measure. 1994;Universitat Polytècnia de Catalunya, Barcelona.
20. Schöning U. A uniform approach to obtain diagonal sets in complexity classes. Theoret. Comput. Sci. 18:1982;95-103.
21. Selman A. L. P-selective sets, tally languages, and the behaviour of polynomial time reducibilities on NP. Math. Systems Theory. 13:1979;55-65.