@tom7 @Jonathan_Blow My understanding is that NP-complete means that it has been proven to have a polynomimal-time answer verifier.
@supermoof @tom7 @Jonathan_Blow I think everything else I said is correct though.
-
-
@supermoof@tom7@Jonathan_Blow Ie., traveling salesman is not NP-complete and does not have a P-verifier. -
@supermoof@tom7@Jonathan_Blow Here's the Wikipedia diagram, too :)pic.twitter.com/qNJtoDJh7h
- 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.