In complexity theory, P is the set of decision problems solvable in polynomial time on a deterministic Turing machine. See Complexity classes P and NP. |
In complexity theory, P is the set of decision problems solvable in polynomial time on a deterministic Turing machine. See Complexity classes P and NP. |