@tom7 @Jonathan_Blow Therefore, it is _NP-hard_ (harder than NP-complete), NOT NP-complete. It is a _harder_ class of problems.
@tom7 @Jonathan_Blow But at the moment, we don't know any P-verifier because we still think P != NP.
-
-
@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 NP
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.