decision problems that are at least as hard as NP-complete problems
NP-hard problems are NP-complete and harder problems. More precisely, a decision problem $H$ is NP-hard if there is another problem $H'$ that is NP-complete that can be reduced in polynomial time to $H$, i.e. solving $H$ leads to a solution for $H'$.
See also time-complexity, complexity-theory
|
created |
11 years, 9 months ago |
|
viewed |
36 times |
|
active |
11 years, 8 months ago |
|
editors |
1 |
