Approaches for solving P vs NP problem

Question

I want to get acquainted with approaches made to solve P vs NP problem.

1) What is already achieved in solving the P vs NP problem?

2) What articles are most cited/famous in that field? Please, provide links for them.

3) How one can divide existing approaches to different classes?

This would be better asked on http://cstheory.stackexchange.com. Also, it is fairly easy to Google something like "P vs. NP survey." — Qiaochu Yuan, Jan 22 '11 at 20:23

score 4 · Answer 1 · answered Jan 22 '11 at 20:45

4

Someone else posted this link in partial reply to another question recently. I think it answers 1 and 2, at least. http://www.win.tue.nl/~gwoegi/P-versus-NP.htm

answered Jan 22 '11 at 20:45

Peter Taylor

It technically answers 2, but I think in a somewhat perverse sense. – Willie Wong Jan 23 '11 at 00:14
@Willie Wong, I think it also answers 3 in a somewhat perverse sense: we can divide existing approaches into crackpot and non-crackpot, with all but a handful (maybe all but one) of them falling into the crackpot category. – Peter Taylor Jan 23 '11 at 07:25
:D, it is also funny, that nearby half of researchers claim P=NP, nearby half claim opposite. – Jan 23 '11 at 10:27

1 Answers1