@tom7 @Jonathan_Blow Another way to think of it would be that if someone proves P=NP, NP-complete problems _become_ P problems, right.
@tom7 @Jonathan_Blow Sadly, Wikipedia doesn't offer much help here, have to go to an complexity book, etc:pic.twitter.com/yiwLANowec
-
-
@cmuratori@Jonathan_Blow Yeah, usually you can go from the decision problem to an optima problem by binary searching. Decision is indeed NPThanks. 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.