NP-hard

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Adjective[edit]

English Wikipedia has an article on:
Wikipedia

NP-hard (not comparable)

  1. (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. (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[edit]

Translations[edit]

Retrieved from "https://en.wiktionary.org/w/index.php?title=NP-hard&oldid=70948560"