Abstract
We revisit the computational power of constant width polynomial size planar nondeterministic branching programs. We show that they are capable of computing any function computed by a ${{\bf \Pi}_2 \circ {\rm \bf CC^0} \circ {\rm \bf AC^0}}$ circuit in polynomial size. In the quasipolynomial size setting we obtain a characterization of ${\rm \bf ACC^0}$ by constant width planar nondeterministic branching programs.
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.
