In computational complexity theory [Computational complexity theory], NP (nondeterministic polynomial time) is a complexity class used to classify decision problems. NP is the set of decision problems for which the problem instances, where the answer is “yes”, have proofs verifiable in polynomial time by a deterministic Turing machine, or alternatively the set of problems that can be solved in polynomial time by a nondeterministic Turing machine.
Bibliography
“NP (Complexity).” 2022. Wikipedia, November. https://en.wikipedia.org/w/index.php?title=NP_(complexity)&oldid=1119703601.