News for hackers. Stuff that matters.
Re:The polynomial algorithm for 3-SAT problem (or P=NP) by stevejohnson on Wednesday January 19, 2011 @07:24PM (#2121939)
"Instantaneously, for free" is nowhere near what this paper claims (O(n^4m)).
Re:The polynomial algorithm for 3-SAT problem (or P=NP) by jrockway on Wednesday January 19, 2011 @08:17PM (#2122103)
But P is good and NP is bad, and fast is good and slow is bad, so P must be fast!
Re:The polynomial algorithm for 3-SAT problem (or P=NP) by khafra on Thursday January 20, 2011 @09:25AM (#2123682)
"Proof by halo bias;" this could be a valuable new technique to math in the social sciences.