NP-easy

短语

释义与例句

adj.
  1. 1.

    Solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP.

    计算机 工程 数学