231 - Order Notationhttp://youtu.be/jo9rfWct1OI?a
@tom_forsyth Looking it up, it looks like _real_ traveling salesman does not yet have a P-verifier, but the weaker decision problem does.
-
-
@tom_forsyth So that is probably what confused people. -
@cmuratori NP-hard means that it is >= in terms of difficulty for problems in NP but might not necessary be NP at all.
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.