Abstract
Suppose that a Boolean functionf is computed by a constant depth circuit with 2 m AND-, OR-, and NOT-gates—andm majority-gates. We prove thatf is computed by a constant depth circuit with\(2^{m^{O(1)} }\) AND-, OR-, and NOT-gates—and a single majority-gate, which is at the root.
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.
