Abstract
A condition on a class of languages is developed. This condition is such that every tally language in that class is accepted in polynomial time by a deterministic Turing machine if and only if every language accepted in exponential time by a nondeterministic machine is also accepted in exponential time by a deterministic machine.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
