Abstract
What is the Σ32-circuit complexity (depth 3, bottom-fanin 2) of the 2n-bit inner product function? The complexity is known to be exponential 2αnn for some αn=Ω(1). We show that the limiting constant α≔limsupαn satisfies0.847...≤α≤0.965.... Determining α is one of the seemingly-simplest open problems about depth-3 circuits. The question was recently raised by Golovnev, Kulikov, and Williams (ITCS 2021) and Frankl, Gryaznov, and Talebanfard (ITCS 2022), who observed that α∈[0.5,1]. To obtain our improved bounds, we analyse a covering LP that captures the Σ32-complexity up to polynomial factors. In particular, our lower bound is proved by constructing a feasible solution to the dual LP.
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.
