In computational complexity theory, the defining property of a class of problems that are, informally, ‘at least as hard as the hardest problems in NP’. A simple example of an NP-hard problem is the subset sum problem.
