computational complexity theory In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and explores the relationships between these classifications. A computational problem ...

, DLIN is the class of decision problems that can be solved by a

multitape Turing machine A multi-tape Turing machine is a variant of the Turing machine that utilizes several tapes. Each tape has its own head for reading and writing. Initially, the input appears on tape 1, and the others start out blank. This model intuitively seems mu ...

in linear time, ''O''(''n''). It is known that this class differs from its nondeterministic counterpart, NLIN., Theorem 3.9

References

Structural complexity theory Complexity classes {{Comp-sci-theory-stub