nondeterministic polynomial time

短语

词形变化

nondeterministic polynomial times 复数 nondeterministic polynomial times

释义与例句

n.
  1. 1.

    A class of decision problems for which a yes solution can be verified by a deterministic Turing machine in polynomial time, or alternatively a set of problems that can be solved in polynomial time by a nondeterministic Turing machine.

    可数 不可数 计算机 工程 数学