English

Adjective

NP-hard ‎(not comparable)

1. (computing theory) 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. (computing theory) An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction.

Related terms

• NP-complete
• NP-easy
• NP-equivalent

Translations