1.Previous
3.Next

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.

* NP is the set of decision problems solvable in polynomial time by a nondeterministic Turing machine.
* NP is the set of decision problems verifiable in polynomial

1.Previous
3.Next