np-hard
Word Rarity
Rare
Frequency: 3.57 in modern English
12
Scrabble Score
6
Letters
2
Syllables
6
Unique Chars
Meaning
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.
adj
An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction.