NP-complete

短语

释义与例句

adj.
  1. 1.

    That is both NP (solvable in polynomial time by a non-deterministic Turing machine) and NP-hard (such that any (other) NP problem can be reduced to it in polynomial time).

    计算机 工程 数学