NP-hard

形容词 adj.
中文释义

英文释义

形容词 adj.
  1. 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. not-comparable
  2. An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction. not-comparable

词汇关系

相关词
NP-complete NP-easy NP-equivalent
0 次浏览 数据来源: Wiktionary