Re:The polynomial algorithm for 3-SAT problem (or P=NP)
by bdr on Wednesday January 19, 2011 @07:01PM
(#2121871)
This is easy: just put your algorithm behind a web API. When I'm solving my NP-complete problems instantaneously, for free, I'll believe you.
[ Parent
| on HN ]
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.
Re:The polynomial algorithm for 3-SAT problem (or P=NP)
by dangrossman on Wednesday January 19, 2011 @07:48PM
(#2122020)
Why would a polynomial time algorithm become instantaneous if you stick it behind an API?
Re:The polynomial algorithm for 3-SAT problem (or P=NP)
by ezalor on Wednesday January 19, 2011 @08:02PM
(#2122058)
The magic of the cloud! Imagine running that on Heroku (for instance): it would be costly (price) but possible.
Re:The polynomial algorithm for 3-SAT problem (or P=NP)
by swolchok on Wednesday January 19, 2011 @09:17PM
(#2122297)
Just parallelize your algorithm and use n^5 machines ;)
Re:The polynomial algorithm for 3-SAT problem (or P=NP)
by wlievens on Thursday January 20, 2011 @03:31AM
(#2123082)
Is any polynomial algorithm parallelizable?