nondeterministic polynomial time
Jump to navigation
Jump to search
English[edit]
Noun[edit]
nondeterministic polynomial time (countable and uncountable, plural nondeterministic polynomial times)
- (computer science) 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.
- Synonym: NP time