A set or property of computational search problems. 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 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.