NPhard
Definition from Wiktionary, the free dictionary
English[edit]
Adjective[edit]
NPhard (not comparable)
 (computing theory) A problem H is NPhard if and only if there is an NPcomplete problem L that is polynomial time Turingreducible to H.
 (computing theory) An alternative definition restricts NPhard to decision problems and then uses polynomialtime manyone reduction instead of Turing reduction.
Related terms[edit]
Translations[edit]
hard
