@tom7 @Jonathan_Blow My understanding is that NP-complete means that it has been proven to have a polynomimal-time answer verifier.
@tom7 @Jonathan_Blow Well, the hope would be that it actually is easy to you, because then P=NP! Go try and make sure you can't solve it :)
-
-
@cmuratori@Jonathan_Blow no, I was thinking it's easy to go from decision problem to full in this case, but maybe not for general TSPThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@cmuratori@Jonathan_Blow I'll read up. In portmantout, edge weights are bounded by problem size. Thanks for pointing out my mistake! :) -
@tom7@Jonathan_Blow Let me know what the answer turns out to be!
End of conversation
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.