In complexity theory, NP ("Nondeterministic Polynomialtime") is the set of decision problems solvable in polynomial time on a nondeterministic Turing machine. Or, equivalently, YES answers are checkable in polynomial time on a deterministic Turing machine given the right information.
A language L belongs to NP if there exists a two input polynomial time algorithm A and a constant c such that
Search Encyclopedia

Featured Article
