A language solved in quadratic time implies the use of what type of Turing machine?
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.