## A Small Span Theorem for P/Poly-Turing Reductions

- Jack H. Lutz
- Structure in Complexity Theory Conference
- 1995

- Published 1994 in STACS
DOI:10.1007/3-540-57785-8_159

Under the hypothesis that NP does not have p-measure 0 (roughly, that NP contains more than a negligible subset of exponential time), it is show n that there is a language that is P T -complete (\Cook complete"), but not P m -complete (\Karp-Levin complete"), for NP. This conclusion, widely believed to be true, is not known to follow from P 6= NP or other… CONTINUE READING

### Presentations referencing similar topics