Paper Info
Title
An almost Cubic Lower Bound for Depth Three Arithmetic Circuits.
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].
Year
Venue
DocType
2016
Electronic Colloquium on Computational Complexity (ECCC)
Conference
Volume
Citations 
PageRank 
23
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Neeraj Kayal126319.39
Chandan Saha222716.91
Sébastien Tavenas310.71