Definition of NP-hard

1. Adjective. (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. ¹

2. Adjective. (computing theory) An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction. ¹

¹ Source: wiktionary.com

Lexicographical Neighbors of NP-hard

NORs
NOS
NOT
NOTAM
NOTAR
NOT function
NOT functions
NOT operator
NOTs
NOW
NO synthase
NOx
NP
NP-complete
NP-completeness
NP-hard (current term)
NPA
NPC
NPCA
NPD
NPF
NPH insulin
NPI
NPK
NPL
NPN
NPO
NPOESS
NPOESS Preparatory Project
NPP

Other Resources:

Search for NP-hard on Dictionary.com!Search for NP-hard on Thesaurus.com!Search for NP-hard on Google!Search for NP-hard on Wikipedia!

Search