TR20-028 Authors: Nikhil Gupta, Chandan Saha, Bhargav Thankey

Publication: 27th February 2020 17:03

Downloads: 516

Keywords:

We show an $\widetilde{\Omega}(n^{2.5})$ lower bound for general depth four arithmetic circuits computing an explicit $n$-variate degree $\Theta(n)$ multilinear polynomial over any field of characteristic zero. To our knowledge, and as stated in the survey by Shpilka and Yehudayoff (FnT-TCS, 2010), no super-quadratic lower bound was known for depth four circuits over fields of characteristic other than 2 before this work. The previous best lower bound is $\widetilde{\Omega}(n^{1.5})$ shown in the work of Sharma (Master's Thesis, 2017), which is a slight quantitative improvement over the roughly $\Omega(n^{1.33})$ bound obtained by invoking the super-linear lower bound for constant depth circuits in the works of Raz (STOC, 2008) and Shoup and Smolensky (FOCS, 1991).

Our lower bound proof follows the approach of the almost cubic lower bound for depth three circuits in the work by Kayal, Saha and Tavenas (ICALP, 2016) by replacing the shifted partials measure with a suitable variant of the projected shifted partials measure, but it differs from their proof at a crucial step - namely, the way "heavy" product gates are handled. Loosely speaking, a heavy product gate has a relatively high fan-in. Product gates of a depth three circuit compute products of affine forms, and so, it is easy to prune $\Theta(n)$ many heavy product gates by projecting the circuit to a low-dimensional affine subspace as shown in the works by Kayal, Saha and Tavenas (ICALP, 2016) and Shpilka and Wigderson (CCC, 1999). However, in a depth four circuit, the second (from the top) layer of product gates compute products of polynomials having arbitrary degree, and hence it was not clear how to prune such heavy product gates from the circuit. We show that heavy product gates can also be eliminated from a depth four circuit by projecting the circuit to a low-dimensional affine subspace, unless the heavy gates together account for $\widetilde{\Omega}(n^{2.5})$ size. This part of our argument is inspired by a well-known greedy approximation algorithm for the weighted set-cover problem.