Meanings
adjectiveNP-hard (not comparable)
- not comparablecomputingA 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 comparablecomputingAn alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction.
Translations
Finnish NP-kova, NP-vaikea
- NP-kovahard
- NP-vaikeahard
French NP-dur
- NP-durhard
Hebrew NP־קשה
- NP־קשהhard
Cite this entry
APA
NP-hard. (n.d.). In WatkinsX Dictionary. Retrieved November 3, 2026, from https://dictionary.watkinsx.com/word/NP-hard
MLA
“NP-hard.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/NP-hard. Accessed November 3, 2026.
Chicago
WatkinsX Dictionary, s.v. “NP-hard,” accessed November 3, 2026, https://dictionary.watkinsx.com/word/NP-hard.
Source: NP-hard on Wiktionary, CC BY-SA 4.0.