Cook Versus Karp-Levin: Separating Completeness Notions if NP Is not Small (Extended Abstract)

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