The portmantout: A portmanteau of every word in English! vid: http://youtu.be/QVn2PZGZxaI page: http://tom7.org/portmantout/
@tom7 @Jonathan_Blow The traveling salesman problem has been proven to _not_ have a polynomial-time answer verifier.
-
-
@tom7@Jonathan_Blow Therefore, it is _NP-hard_ (harder than NP-complete), NOT NP-complete. It is a _harder_ class of problems. -
@tom7@Jonathan_Blow Another way to think of it would be that if someone proves P=NP, NP-complete problems _become_ P problems, right. - Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.