NP-hard
Meanings
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.
- An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction.
Word forms
Related words
Translations
This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.