Abstract

This paper proves that alternating computations with O(t(n)) time can simulate nondeterministic computations with O(t(n) log* t(n)) time and O(t(n)) nondeterministic moves. From this the authors prove that nondeterministic linear time is not closed under complementation if nondeterministic Turing machines with O(n log* n) time and linear nondeterministic moves are strictly more powerful than nondeterministic linear time. >

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.