@tom7 @Jonathan_Blow Traveling salesman is not NP-complete! It is NP-hard!!! :/
@tom7 @Jonathan_Blow And if you actually do know of an in-P way to verify and answer to traveling salesman, you really need to tell us!!!
-
-
@tom7@Jonathan_Blow Current CS research, as far as I'm aware, thought it already proved that was impossible, so it'd be major news. -
@cmuratori@Jonathan_Blow if it's not in NP (=P time verifier) then you're right. It seemed easy to me though. Maybe I made a mistake there. - 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.