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
Balcazar, Jose Luis; Diaz, Josep; Gabarro, Joaquim (1990). Structural Complexity II . Springer Verlag. ISBN 3-540-52079-1 , Theorem 3.9
Categories :
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
**DISCLAIMER** We are not affiliated with Wikipedia, and Cloudflare.
The information presented on this site is for general informational purposes only and does not constitute medical advice.
You should always have a personal consultation with a healthcare professional before making changes to your diet, medication, or exercise routine.
AI helps with the correspondence in our chat.
We participate in an affiliate program. If you buy something through a link, we may earn a commission 💕
↑