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)).
[ Parent
| on HN ]