np-hard
adj 2
Definitions
adj
1
A problem H is NP-hard if and only if there is an NP-complete problem L that is polynomial time Turing-reducible to H.
2
An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction.
Your note
not saved0 chars