Abstract
We present a Boolean function in n variables that is computable in depth 2 monotone AC 0 but requires 2 Ω(√n) size read-once branching programs. The function we consider is defined by the blocking sets of a finite projective plane.
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.
