---
title: DLIN
slug: dlin
qid: 
snapshot: enwiki-001191294890
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1191294890
tags: [23057298, 23468805, 28699527, 29176649]
---

# DLIN

> [!note] Provenance
> Snapshot `enwiki-001191294890` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1191294890> · Licensed CC BY-SA 4.0

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.

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. ==References==
