@tom7 @Jonathan_Blow The traveling salesman problem has been proven to _not_ have a polynomial-time answer verifier.
@tom7 @Jonathan_Blow So traveling salesman _could_ still become P-verifiable someday if P=NP.
-
-
@tom7@Jonathan_Blow But at the moment, we don't know any P-verifier because we still think P != NP. -
@tom7@Jonathan_Blow Sadly, Wikipedia doesn't offer much help here, have to go to an complexity book, etc:pic.twitter.com/yiwLANowec
- 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.