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 claSSNP in polynomial time. Some NP-hard problemS are alSo in NP (theSe are called "NP-complete"), Some are not. If you could reduce an NP problem to an NP-hard problem and then Solve it in polynomial time, you could Solve all NP problemS. See alSo computational complexity. [ExampleS?] (1995-04-10)
