NP-hard
programming
NP-hard
A problem $f$ is NP-hard if for all search problems $g$ there is a many-one reduction from $g$ to $f$. In other terms, $f$ is as hard as any search problem.
A problem $f$ is NP-hard if for all search problems $g$ there is a many-one reduction from $g$ to $f$. In other terms, $f$ is as hard as any search problem.