Abstract
We use algebraic techniques to obtain superlinear lower bounds on the size of bounded-width branching programs to solve a number of problems. In particular, we show that any bounded-width branching program computing a nonconstant threshold function has length Ω(n log log n), improving on the previous lower bounds known to apply to all such threshold functions. We also show that any program over a finite solvable monoid computing a product in a nonsolvable group has length Ω(n log log n). This result is a step toward proving the conjecture that the circuit complexity class ACC0 is properly contained in 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.
