nondeterministic polynomial time
Word Rarity
Very rare
Frequency: Zipf frequency 1.72 in modern English
44
Scrabble Score
30
Letters
10
Syllables
14
Unique Chars
Meaning
noun
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