NP-hard
Hello, you have come here looking for the meaning of the word NP-hard. In DICTIOUS you will not only get to know all the dictionary meanings for the word NP-hard, but we will also tell you about its etymology, its characteristics and you will know how to say NP-hard in singular and plural. Everything you need to know about the word NP-hard you have here. The definition of the word NP-hard will help you to be more precise and correct when speaking or writing your texts. Knowing the definition ofNP-hard, as well as those of other words, enriches your vocabulary and provides you with more and better linguistic resources.
English
Adjective
NP-hard (not comparable)
- (computing theory) 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.
- (computing theory) An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction.