On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
On Reducibility to Complex or Sparse Sets
Journal of the ACM (JACM)
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Some Comments on Functional Self-Reducibility and the NP Hierarchy
Some Comments on Functional Self-Reducibility and the NP Hierarchy
On some subrecursive reducibilities.
On some subrecursive reducibilities.
Two results on polynomial-time reducibilities
ACM SIGACT News
Bi-Immunity Separates Strong NP-Completeness Notions
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
The General Notion of a Dot-Operator
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
SIGACT news complexity theory column 40
ACM SIGACT News
Bi-immunity separates strong NP-completeness notions
Information and Computation
On non-erasing oracle tapes in space bounded reducibility
ACM SIGACT News
| Hi-index | 0.00 |
An open question of [LLS] is whether polynomial time many-one reducibility ≤mP and polynomial time Turing reducibility ≤TP differ on NP. An affirmative answer to this question would yield P @@@@ NP as a corollary, but it is possible that P @@@@ NP even if the answer is negative. Ladner, Lynch, and Selman [LLS] conjecture that if P @@@@ NP then ≤mP and ≤TP differ on NP. One method that might prove helpful in settling this conjecture is to exhibit an efficient construction that builds from any nonpolynomial set A a set B such that A ≤TP B but A @@@@mP B. If such a construction were sufficiently efficient, then when applied to a set A in NP - P it would yield a set B in NP/