Is there any decidable problem that is NOT NP-HARD?

Question

Is there a proof that there exists a decidable problem that is NOT NP-HARD??

score 3 · Answer 1 · answered Dec 03 '11 at 16:34

3

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.

answered Dec 03 '11 at 16:34

sxd

haha... wonderful.. thnx – rakesh Dec 03 '11 at 16:41
and under $P=NP$ only $\emptyset$ and $A^{\ast}$ are not NP-hard under polynomial time reductions. – sdcvvc Dec 03 '11 at 17:27
1

@sdcvvc, not NP-hard you mean. – sxd Dec 03 '11 at 17:32
Yes, thanks for the correction. – sdcvvc Dec 03 '11 at 17:32

1 Answers1