DLIN
Jump to navigation
Jump to search
In computational complexity theory, DLIN is the class of decision problems that can be solved by a multitape Turing machine in linear time, O(n). It is known that this class differs from its nondeterministic counterpart, NLIN.[1]
References
[edit | edit source]- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)., Theorem 3.9