NLIN
In computational [complexity theory], NLIN is the class of decision problems that can be solved by a Nondeterministic [Turing machine|nondeterministic multitape Turing machine] in linear time, O. It is known that this class differs from its deterministic counterpart, DLIN.