Definitions from Wiktionary (nondeterministic polynomial time)
▸ noun: (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.
▸ Words similar to nondeterministic polynomial time
▸ Usage examples for nondeterministic polynomial time
▸ Idioms related to nondeterministic polynomial time
▸ Wikipedia articles (New!)
▸ Words that often appear near nondeterministic polynomial time
▸ Rhymes of nondeterministic polynomial time
▸ Invented words related to nondeterministic polynomial time
▸ noun: (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.
▸ Words similar to nondeterministic polynomial time
▸ Usage examples for nondeterministic polynomial time
▸ Idioms related to nondeterministic polynomial time
▸ Wikipedia articles (New!)
▸ Words that often appear near nondeterministic polynomial time
▸ Rhymes of nondeterministic polynomial time
▸ Invented words related to nondeterministic polynomial time