Lecture 3

Ladner's Theorem that, assuming P is different than NP, there is a language L in NP, L not in P and L not NP-complete.

Two Proofs of Ladner's Theorem by Lance Fortnow