Computational complexity class of problems solvable by a deterministic Turing Machine in polynomial time.