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

Abstract

In this paper, we show exponential lower bounds for the class of homogeneous depth-5 circuits over all small finite fields. More formally, we show that there is an explicit family \Pd : d ∈ N\ of polynomials in VNP, where Pd is of degree d in n = dO(1) variables, such that over all finite fields Fq, any homogeneous depth-5 circuit which computes Pd must have size at least (q(d)). To the best of our knowledge, this is the first super-polynomial lower bound for this class for any field Fq ≠ F2. Our proof builds up on the ideas developed on the way to proving lower bounds for homogeneous depth-4 circuits [GKKS13, FLMS13, KLSS14, KS14] and for non-homogeneous depth-3 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 Fqn → Fq 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].

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…