NP-hard

短语

释义与例句

adj.
  1. 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.

    计算机 工程 数学
  2. 2.

    An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction.

    计算机 工程 数学