Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Computational Work and Time on Finite Machines
Journal of the ACM (JACM)
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Efficient reducibility between programming systems (Preliminary Report)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Two results on polynomial-time reducibilities
ACM SIGACT News
Complexity-class-encoding sets
Journal of Computer and System Sciences
Survey of polynomial transformations between NP-complete problems
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |
Comparison of the polynomial-time-bounded reducibilities introduced by Cook [1] and Karp [4] leads naturally to the definition of several intermediate truth-table reducibilities. We give definitions and comparisons for these reducibilities; we note, in particular, that all reducibilities of this type which do not have obvious implication relationships are in fact distinct in a strong sense. Proofs are by simultaneous diagonalization and encoding constructions. Work of Meyer and Stockmeyer [7] and Gill [2] then leads us to define nondeterministic versions of all of our reducibilities. Although many of the definitions degenerate, comparison of the remaining nondeterministic reducibilities among themselves and with the corresponding deterministic reducibilities yields some interesting relationships.