Cook versus Karp-Levin: Separating completeness notions if NP is not small

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

Volumn 775 LNCS, Issue , 1994, Pages 415-426

  Lutz, Jack H ^a   Mayordomo, Elvira ^b  

^a IOWA STATE UNIVERSITY   (United States)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CLASS SEPARATION; DECISION PROBLEMS; EXPONENTIAL TIME; P-COMPLETE; SEARCH PROBLEM; TRUTH TABLES;

SEPARATION;

EID: 0347669790     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57785-8_159     Document Type: Conference Paper

References (29)

1. M. Bellare and S. Goldwasser, The complexity of decision versus search, SIAM Journal on Computing, to appear. See also MIT Laboratory for Computer Science Technical Memorandum MIT/LCS/TM 444.
2. L. Berman and J. Hartmanis, On isomorphism and density of NP and other complete sets, SIAM Journal on Computing 6 (1977), pp. 305-322.
3. R. V. Book, Tally languages and complexity classes, Information and Control 26 (1974), pp. 186-193.
4. H. Buhrman, S. Homer, and L. Torenvliet, Completeness for nondeterministic complexity classes, Mathematical Systems Theory 24 (1991), pp. 179-200.
5. S. A. Cook, The complexity of theorem proving procedures, Proceedings of the Third ACM Symposium on the Theory of Computing, 1971, pp. 151-158.
6. S. Homer, Structural properties of nondeterministic complete sets, Proceedings of the Fifth Annual Structure in Complexity Theory Conference, 1990, pp. 3-10.
7. D. W. Juedes and J. H. Lutz, The complexity and distribution of hard problems, Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 177-185. SIAM Journal on Computing, to appear.
8. R. M. Karp, Reducibility among combinatorial problems, In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pp. 85-104. Plenum Press, 1972.
9. K. Ko and D. Moore, Completeness, approximation and density, SIAM Journal on Computing 10 (1981), pp. 787-796.
10. R. Ladner, N. Lynch, and A. Selman, A comparison of polynomial-time reducibilities, Theoretical Computer Science 1 (1975), pp. 103-123.
11. L. A. Levin, Universal sequential search problems, Problems of Information Transmission 9 (1973), pp. 265-266.
12. L. Longpré and P. Young, Cook reducibility is faster than Karp reducibility in NP, Journal of Computer and System Sciences 41 (1990), pp. 389-401.
13. J. H. Lutz, Almost everywhere high nonuniform complexity, Journal of Computer and System Sciences 44 (1992), pp. 220-258.
14. J. H. Lutz, Resource-bounded measure, in preparation.
15. J. H. Lutz and E. Mayordomo, Measure, stochasticity, and the density of hard languages, SIAM Journal on Computing, to appear.
16. E. Mayordomo, Almost every set in exponential time is P-bi-immune, Seventeenth International Symposium on Mathematical Foundations of Computer Science, 1992, pp. 392-400. Springer-Verlag. Theoretical Computer Science, to appear.
17. A. R. Meyer, 1977, On isomorphism and density of NP and other complete sets, SIAM Journal on Computing 6 pp. 305-322.
18. M. Ogiwara and O. Watanabe, On polynomial bounded truth-table reducibility of NP sets to sparse sets, SIAM Journal on Computing 20 (1991), pp. 471-483.
19. P. Orponen and U. Schöning, The density and complexity of polynomial cores for intractable sets, Information and Control 70 (1986), pp. 54-68.
20. C. P. Schnorr, Klassifikation der Zufallsgesetze nach Komplexität und Ordnung, Z. Wahrscheinlichkeitstheorie verw. Geb. 16 (1970), pp. 1-21.
21. C. P. Schnorr, A unified approach to the definition of random sequences, Mathematical Systems Theory 5 (1971), pp. 246-258.
22. C. P. Schnorr, Zufälligkeit und Wahrscheinlichkeit, Lecture Notes in Mathematics 218 (1971).
23. C. P. Schnorr, Process complexity and effective random tests, Journal of Computer and System Sciences 7 (1973), pp. 376-388.
24. A. L. Selman, P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP, Mathematical Systems Theory 13 (1979), pp. 55-65.
25. A. L. Selman, Reductions on NP and P-selective sets, Theoretical Computer Science 19 (1982), pp. 287-304.
26. O. Watanabe, A comparison of polynomial time completeness notions, Theoretical Computer Science 54 (1987), pp. 249-265.
27. O. Watanabe, On the Structure of Intractable Complexity Classes, PhD thesis, Tokyo Institute of Technology, 1987.
28. O. Watanabe and S. Tang, On polynomial time Turing and many-one completeness in PSPACE, Theoretical Computer Science 97 (1992), pp. 199-215.
29. P. Young, Some structural properties of polynomial reducibilities and sets in NP, Proceedings of the Fifteenth ACM Symposium on Theory of Computing, 1983, pp. 392-401.