A multi-tape Turing machine requires what type of time for a solution?
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.