English

An exponential lower bound for homogeneous depth-5 circuits over finite fields

Computational Complexity 2015-07-02 v1

Abstract

In this paper, we show exponential lower bounds for the class of homogeneous depth-55 circuits over all small finite fields. More formally, we show that there is an explicit family {Pd:dN}\{P_d : d \in \mathbb{N}\} of polynomials in VNP\mathsf{VNP}, where PdP_d is of degree dd in n=dO(1)n = d^{O(1)} variables, such that over all finite fields Fq\mathbb{F}_q, any homogeneous depth-55 circuit which computes PdP_d must have size at least exp(Ωq(d))\exp(\Omega_q(\sqrt{d})). To the best of our knowledge, this is the first super-polynomial lower bound for this class for any field FqF2\mathbb{F}_q \neq \mathbb{F}_2. Our proof builds up on the ideas developed on the way to proving lower bounds for homogeneous depth-44 circuits [GKKS13, FLMS13, KLSS14, KS14] and for non-homogeneous depth-33 circuits over finite fields [GK98, GR00]. Our key insight is to look at the space of shifted partial derivatives of a polynomial as a space of functions from FqnFq\mathbb{F}_q^n \rightarrow \mathbb{F}_q as opposed to looking at them as a space of formal polynomials and builds over a tighter analysis of the lower bound of Kumar and Saraf [KS14].

Cite

@article{arxiv.1507.00177,
  title  = {An exponential lower bound for homogeneous depth-5 circuits over finite fields},
  author = {Mrinal Kumar and Ramprasad Saptharishi},
  journal= {arXiv preprint arXiv:1507.00177},
  year   = {2015}
}
R2 v1 2026-06-22T10:03:40.148Z