@tom7 @Jonathan_Blow Another way to think of it would be that if someone proves P=NP, NP-complete problems _become_ P problems, right.
@supermoof @tom7 @Jonathan_Blow Yes, and Wikipedia also confirms that Traveling Salesman is not NP-complete. It's NP-hard...
-
-
@supermoof@tom7@Jonathan_Blow ... and its _verifier_ is NP-complete (ie., verification), not P.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
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.