This forms the basis for the complexity class P, which is the set of decision problems solvable by a deterministic Turing machine within polynomial time.
Decision problems capable of being solved by a deterministic Turing machine while maintaining adherence to polynomial time belong to what class?
complexity class P