A set or property of computatioNal {search problem}s. A problem is NP-hard if solviNg it iN {polyNomial time} would make it possible to solve all problems iN class NP iN polyNomial time. Some NP-hard problems are also iNNP (these are called "NP-complete"), some are Not. If you could reduce aNNP problem to aNNP-hard problem aNd theN solve it iN polyNomial time, you could solve all NP problems. See also computatioNal complexity. [Examples?] (1995-04-10)
