Take the 2-minute tour ×
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.

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

share|improve this question

1 Answer 1

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.

share|improve this answer
    
haha... wonderful.. thnx –  rakesh Dec 3 '11 at 16:41
    
and under $P=NP$ only $\emptyset$ and $A^{\ast}$ are not NP-hard under polynomial time reductions. –  sdcvvc Dec 3 '11 at 17:27
1  
@sdcvvc, not NP-hard you mean. –  sxd Dec 3 '11 at 17:32
    
Yes, thanks for the correction. –  sdcvvc Dec 3 '11 at 17:32

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.