Meaning of NP-hard | Babel Free

Definitions

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.
   not-comparable
2. An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction.
   not-comparable

CEFR level