NLIN

NLIN

NLIN

Add article description

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

References

  1. [1]
    Balcazar, Jose Luis; Diaz, Josep; Gabarro, Joaquim (1990). Structural Complexity II. Springer Verlag. ISBN 3-540-52079-1., Theorem 3.9
P ≟ NP 

This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.
Share this article:

This article uses material from the Wikipedia article NLIN, and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.