เอ็นพี

Also known as NP class, nondeterministic polynomial, nondeterministic polynomial time, nondeterministic polynomial complexity class, non-deterministic polynomial

computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time