Nondeterministic polynomial timeA set of decision problems that can be solved by a Non-Deterministic Turing Machine in a polynomial time. By definition, it means verified in polynomial time.
Alan Jo
