News for hackers. Stuff that matters.

A comment on The polynomial algorithm for 3-SAT problem (or P=NP). Parent comment

Re:The polynomial algorithm for 3-SAT problem (or P=NP) by vtail on Wednesday January 19, 2011 @06:48PM (#2121823)
3-SAT is NP-complete, so if you have an algorithm to solve it in polynomial time, you've solved them all.

http://en.wikipedia.org/wiki/3SAT#3-satisfiability http://en.wikipedia.org/wiki/NP-complete

[ Parent | on HN ]

There are no comments on this comment yet.