Np-hard

adj

adj ·Rare ·Advanced level

Definitions

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

More for "np-hard"

SynonymsSentencesPronunciationTranslate

Next best steps

Find stronger synonymsSee usage examplesCheck pronunciationBrowse writing guides

Data sourced from Wiktionary, WordNet, CMU, and other open linguistic databases. Updated March 2026.