Is there a proof that there exists a decidable problem that is NOT NP-HARD??
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
Very simple answer:
Since you need one $x \in A$, and one $x \not \in A$ for a polynomial time reduction, $A = \emptyset$ cannot be a hard language for NP.