Word.ws English Dictionary

NP-hard

NP-hard adjective: 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.

Adjective

NP-hard (not comparable)

  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.

Questions about NP-hard

What does NP-hard mean?
NP-hard means 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.
What part of speech is NP-hard?
NP-hard is an adjective.

Words near NP-hard in the dictionary

  1. NP time
  2. NP-complete
  3. NP-completeness
  4. NP-easy
  5. NP-equivalent
  6. NP-hard
  7. NPA
  8. NPAPI
  9. NPAS
  10. NPC
  11. NPCA

Source and license

Adapted from Wiktionary: NP-hard (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “NP-hard.” Word.ws, https://word.ws/np-hard. Based on Wiktionary, CC BY-SA 4.0.