noun
Meaning 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.
Definition source: English Wiktionary via Wiktextract
Usage: countable, uncountable
Topics: computer, computing, engineering, mathematics, natural-sciences, physical-sciences, science, sciences
No example sentence was provided for this meaning.
Meaning relationships
Synonyms: NP time
Antonyms: none provided