According to the selected answer on this question NP-hard problems do NOT have to be decision problem. But by definition all NP-hard problems can be karp-reduced from any NP-problem in polynomial time; thus, implying that the answer from the reduction must be the same as the NP-problem which is yes/no => decision problem. So isn't NP-hard problems in fact always decision problems?
Asked
Active
Viewed 1,896 times
3
Ferus
- 143
- 5