Abstract
D. M. Barrington proved the coincidence of the class NC1 of functions computable by the circuits of logarithmic depth with the class of functions computable by branching programs of constant width and polynomial length (BWBP). In this paper, the structure of branching programs suggested by the Barrington method is defined more exactly. Namely, it is proved that we can compute all functions from NC1 and only them by the k-OBDDs of polynomial size and width 5. This can be reformulated as poly(n)-OBDD5 =NC1.
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.
