Delete comment from: Computational Complexity
Anyone know of any good writeups of Ladner's proof?
Lance also has a mini-writeup in his "Diagonalization" paper that may be more useful. I don't know how much more intuitive you can get though.
Sep 13, 2005, 3:08:00 PM
Posted to Favorite Theorems: NP-Incomplete Sets