In complexity theory, the class P consists of decision problems solvable by a deterministic Turing machine within polynomial time