nondeterministic polynomial time

名词 n.
中文释义

英文释义

名词 n.
  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. countable,uncountable

词形变化

nondeterministic polynomial times plural
0 次浏览 数据来源: Wiktionary