NLIN
NLIN
Main page

NLIN

logo
Community Hub0 subscribers
What are your thoughts?
Be the first to start a discussion here.
Be the first to start a discussion here.
NLIN

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.

See all
User Avatar
No comments yet.