NP-hard

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.

Related terms

Translations

hard

Finnish: NP-kova, NP-vaikea
French: NP-dur

Hebrew: NP-קשה‎

This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.