Re:The polynomial algorithm for 3-SAT problem (or P=NP)
by pekinb on Thursday January 20, 2011 @01:27AM
(#2122895)
I may be mistaken, and this might require an exhaustive search of the relevant literature, but I believe 3SAT is NP-Complete and therefore this one example does indeed lead to the stated conclusion.
[ Parent
| on HN ]
There are no comments on this comment yet.