 P (complexity)

$\mathbf{P}$ is the class of decision problems decidable by a deterministic computation in polynomial time.