Papers
Topics
Authors
Recent
Search
2000 character limit reached

Functional lower bounds for restricted arithmetic circuits of depth four

Published 20 Jul 2021 in cs.CC | (2107.09703v1)

Abstract: Recently, Forbes, Kumar and Saptharishi [CCC, 2016] proved that there exists an explicit dO(1)d^{O(1)}-variate and degree dd polynomial Pd∈VNPP_{d}\in VNP such that if any depth four circuit CC of bounded formal degree dd which computes a polynomial of bounded individual degree O(1)O(1), that is functionally equivalent to PdP_d, then CC must have size 2Ω(dlog⁡d)2^{\Omega(\sqrt{d}\log{d})}. The motivation for their work comes from Boolean Circuit Complexity. Based on a characterization for ACC0ACC^0 circuits by Yao [FOCS, 1985] and Beigel and Tarui [CC, 1994], Forbes, Kumar and Saptharishi [CCC, 2016] observed that functions in ACC0ACC^0 can also be computed by algebraic Σ∧ΣΠ\Sigma\mathord{\wedge}\Sigma\Pi circuits (i.e., circuits of the form -- sums of powers of polynomials) of 2log⁡O(1)n2^{\log^{O(1)}n} size. Thus they argued that a 2ω(log⁡O(1)n)2^{\omega(\log^{O(1)}{n})} "functional" lower bound for an explicit polynomial QQ against Σ∧ΣΠ\Sigma\mathord{\wedge}\Sigma\Pi circuits would imply a lower bound for the "corresponding Boolean function" of QQ against non-uniform ACC0ACC^0. In their work, they ask if their lower bound be extended to Σ∧ΣΠ\Sigma\mathord{\wedge}\Sigma\Pi circuits. In this paper, for large integers nn and dd such that ω(log⁡2n)≤d≤n0.01\omega(\log^2n)\leq d\leq n^{0.01}, we show that any Σ∧ΣΠ\Sigma\mathord{\wedge}\Sigma\Pi circuit of bounded individual degree at most O(dk2)O\left(\frac{d}{k^2}\right) that functionally computes Iterated Matrix Multiplication polynomial IMMn,dIMM_{n,d} (∈VP\in VP) over {0,1}n2d\{0,1\}^{n^2d} must have size nΩ(k)n^{\Omega(k)}. Since Iterated Matrix Multiplication IMMn,dIMM_{n,d} over {0,1}n2d\{0,1\}^{n^2d} is functionally in GapLGapL, improvement of the afore mentioned lower bound to hold for quasipolynomially large values of individual degree would imply a fine-grained separation of ACC0ACC^0 from GapLGapL.

Authors (1)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.