On the Structure of Polynomial Time Reducibility

Journal of the ACM (JACM)

Volumn 22, Issue 1, 1975, Pages 155-171

  Ladner, Richard E ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

many one reducibility; polynomial time computation; Turing reducibillty

Indexed keywords

AUTOMATA THEORY;

EID: 0016425038     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321864.321877     Document Type: Article

References (25)

1. Axt, P On a subrecursive hierarchy and primitive recursive degrees Trans. AMS 92 (1959), 85-105.
2. Borodin, A, Constable, R L, and Hopcroft, J E Dense and nondense families of complexity classes IEEE Conf Record Tenth Annual Symp on Switching and Automata Theory, 1969, pp. 7-19.
3. Cook, S A. The complexity of theorem proving procedures. Proc Third Annual ACM Symp on Theory of Computing, 1971, pp 151-158.
4. Friedberg, R M Two recursively enumerable sets of incomparable degrees of unsolvability. Proc Nat Acad Sci U S A. 43 (1957), 236-238.
5. Grzegorczyk, A. Some Classes of Recursive Functions Rozprawy Matematyczhe, Warsaw, 1953.
6. Karp, R M Reducibility among combinatorial problems In Complexity of Computer Computations, R. E Miller and J. W Thatcher, Eds., Plenum, New York, 1972, pp. 85-103.
7. Karp, R M Private communication.
8. Kleene, S C, and Post, E L. The upper semi-lattice of degrees of unsolvability Ann. Math., Ser. 2, 59 (1954), 379-407.
9. Ladner, R E, Lynch, N A, and Selman, A. Comparison of polynomial-time reducibilities. Proc Sixth Annual ACM Syrup on Theory of Computing, 1974, pp 110-121.
10. Lynch, N A. Relativization of the theory of computatmnal complexity Tech Rep. TR-99, Proiect MAC, Ph D. Th, M I.T, Cambridge, Mass., 1972.
11. Machtey, M. Classification of computable functions by primitive recursive classes Proc Third Annual ACM Symp on Theory of Computing, 1971, pp. 251-257.
12. Machtey, M Augmented loop languages and classes of computable functions J Comput. Syst Sci. 6, 6 (1972), 603-624.
13. Machtey, M The honest subrecursive classes are a lattice. Inform and Contr. 24, 3 (1974), 247-263.
14. Machtey, M On the density of honest subrecursive classes. Tech Rep. CSD TR 92, Comput. Sci. Dep, Purdue U., Lafayette, Ind, 1973.
15. Meyer, A R, and Ritchie, D M A classification of the recursive functions z Math Logik Grundlaqen Math 18 (1972), 71-82.
16. Meyer, A R Private communication.
17. Muchnik, A A On the unsolvability of the problem of reducibility in the theory of algorithms. Doklady Akadcmn Navk SSSR, n s, 108 (1956), 194-197.
18. Post, E. L. Recursively enumerable sets of positive integers and their decision problems. Bull. AMS 50 (1944), 284-316.
19. Pratt, V Every prime has a succinct certificate (In preparation).
20. Ritchie, R W Classes of predictably computable functions Trans AMS 106 (1963), 139-173.
21. Rogers Jr, H Theory of Recursive Functions and Effective Computability McGraw-Hill, New York, 1967.
22. Sethi, R Complete register allocation problems Proc Fifth Annual ACM Symp on Theory of Computing, 1973, pp 183-195.
23. Stockmeyer, L J Planar 3-colorability is polynomial complete. SIGACT News 5, 3 (1973), 19-25.
24. Stockmeyer, L. J., and Meyer, A R Word problems requiring exponential time preliminary report Proc Fifth Annual ACM Symp on Theory of Computing, 1973, pp 1-9.
25. Ullman, J D Polynomial complete scheduling problems ACM Operating Syst Rev 7, 4 (1973), Fourth Symposium on Operating System Principles, 96-101.