There are exactly two decision problems known not to be NP-hard.
Replying to @ContentOfMedia
If P=NP, find a Karp reduction from an NP-complete problem to any decision problem. Find the 2 problems for which it fails.
8:19 AM - 3 Nov 2016
0 replies
0 retweets
1 like
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.