News for hackers. Stuff that matters.
Re:The polynomial algorithm for 3-SAT problem (or P=NP) by pedrocr on Wednesday January 19, 2011 @06:46PM (#2121811)
3-SAT isn't just NP, it's NP-Complete. So a solution for 3-SAT is also a solution for all other NP problems.

http://en.wikipedia.org/wiki/NP-complete

There are no comments on this comment yet.