Abstract
A Boolean function in n variables is presented that is computable in depth 2 monotone AC 0 and has prime implicants of length 2 only but requires 2 Ω(√n) size read-once branching programs. The function considered is defined using (1, 1)-disjoint Boolean sums and the solution of the famous problem of Zarankiewicz.
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.
