231 - Order Notationhttp://youtu.be/jo9rfWct1OI?a
-
-
@cmuratori NP-hard means that it is >= in terms of difficulty for problems in NP but might not necessary be NP at all.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@cmuratori@tom_forsyth NP-complete problems only include decision problems. The optimization problem is not much harder though... -
@cmuratori@tom_forsyth ...since if you could solve the decision problem in P-time you could find a solution to the optimization problem... - 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.