7 ms·
"only" NP-hard? You know that NP-hard problems are equal to order harder than NP-complete ones, right?
by sidww2 12y ago
"only" NP-hard? You know that NP-hard problems are equal to order harder than NP-complete ones, right?
- Strilanc 12y agoProbably referring to the definition, not the difficulty.
- codeflo 12y agoYes, NP-complete is a subset of NP-hard. Grandparent states that NP-completeness only applies to decision problems (which is correct), but seems to think that NP-hardness applies to optimization problems (which is incorrect; NP-hard too is a class of decision problems).
- brockrockman 12y agodidn't mean to imply "only" as a less-than comparison -- just a distinction.