LIPIcs - Leibniz International Proceedings in Informatics. 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Doi
Abstract
We show an almost cubic lower bound on the size of any depth three arithmetic circuit computing an explicit multilinear polynomial in n variables over any field. This improves upon the previously known quadratic lower bound by Shpilka and Wigderson [CCC, 1999]
