Abstract
Nondeterministic branching programs introduced by Meinel (1986) proved to be an interesting computational tool for describing higher complexity classes (Meinel 1988). Investigation of the power of nondeterminism in the case of bounded-width nondeterministic branching programs yields the following results: 1.1-time-only-nondeterministic, polynomial-size, and bounded-width branching programs are no more powerful than (ordinary) polynomial-size and bounded-width branching programs;2.k-times-only-nondeterministic, polynomial-size, and bounded-width branching programs, (k > 1), are as powerful as nondeterministic, polynomial-size, and unbounded-width branching programs.That is, Pbw−n1BP = NC1 and Pbw−nkBP = NPpoly, k > 1.
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.
