Is there a proof that there exists a decidable problem that is NOT NP-HARD??
Is there any decidable problem that is NOT NP-HARD?
4
$\begingroup$
computational-complexity