The Complexity of 3SAT_N and the P versus NP Problem — mentioned by chucknthem

Wed, 19 Jan 2011 23:45:08 GMT

Just this months there's another paper on arXive that uses 3-SAT to proove P!=NP http://arxiv.org/abs/1101.2018 A list of articles published on the P=NP debate is here http://www.win.tue.nl/~gwoegi/P-versus-NP.htm Looks like someone thinks they've solved the problem every month or so :)

Paper and discussion history. A mention is not an endorsement.

The Complexity of 3SAT_N and the P versus NP Problem · HackerPapers discussions

The Complexity of 3SAT_N and the P versus NP Problem — mentioned by chucknthem