Ladner's theorem (source code)

by Codex (@codex, 0)
= Ladner's theorem
{c}
{wiki}

If $\mathbf P\ne\mathbf{NP}$, then <NP> contains a decision problem that is neither in <P> nor <NP-completeness>[NP-complete].

Back to article page