Standard Lemma guide
Definitions and examples are grouped by meaning. Pronunciation, history, word forms, translations, descendants, synonyms, antonyms, derived terms, and related words appear whenever the source provides them.
Sound
Each Play button uses your device's default local English voice, or a natural local fallback. The selected voice name appears after playback. This is synthesized speech, not a source recording.
No pronunciation record was provided for this word.
adj
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.
Definition source: English Wiktionary via Wiktextract
Usage: not-comparable
Topics: computing, computing-theory, engineering, mathematics, natural-sciences, physical-sciences, sciences
No example sentence was provided for this meaning.
Synonyms: none provided
Antonyms: none provided
adj
An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction.
Definition source: English Wiktionary via Wiktextract
Usage: not-comparable
Topics: computing, computing-theory, engineering, mathematics, natural-sciences, physical-sciences, sciences
No example sentence was provided for this meaning.
Synonyms: none provided
Antonyms: none provided
History
No etymology was provided for this word.
Across languages
4 source translations are retained for this English entry.
