nondeterministic polynomial time en · NOUN
Meanings
- (countable, uncountable) 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.
Forms
| Spelling | Features | Labels | Source |
|---|---|---|---|
| nondeterministic polynomial times | Number=Plur | lexicographic |