1.Previous
3.Next

in polynomial time
* NP: The complexity class of decision problems that can be solved on a non-deterministic Turing machine in polynomial time
* ZPP: The complexity class of decision problems that can be solved with zero error on a probabilistic Turing machine in polynomial time
* RP:

1.Previous
3.Next