Hacker News Reader

I think he is showing the clique problem cannot be solved in polynomial time. Since clique is in NP and not P, P!=NP.

The claim is that since clique is in NP-complete and not P, P != NP. (Every problem in P is in NP.)