NP-hard en · ADJ
Meanings
- (not-comparable) 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) An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction.
Relateds
NP-easy · NP-complete · NP-equivalent
Translations (4)
fr NP-dur (hard) · fi NP-kova (hard) · fi NP-vaikea (hard) · he NP־קשה (hard)