Abstract
In this paper, we show exponential lower bounds for the class of homogeneous depth- circuits over all small finite fields. More formally, we show that there is an explicit family of polynomials in , where is of degree in variables, such that over all finite fields , any homogeneous depth- circuit which computes must have size at least . To the best of our knowledge, this is the first super-polynomial lower bound for this class for any field . Our proof builds up on the ideas developed on the way to proving lower bounds for homogeneous depth- circuits [GKKS13, FLMS13, KLSS14, KS14] and for non-homogeneous depth- 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 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].
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.