11 citations · 66 across the 33 of their papers we have counts for
Showing 2013 · cs.CCShow all
2 papers · 2 filters
cs.CC2013★ 3 cited
Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits
Mrinal Kumar, Shubhangi Saraf
In this paper, we prove superpolynomial lower bounds for the class of homogeneous depth 4 arithmetic circuits. We give an explicit polynomial in VNP of degree in variable…
cs.CC2013★ 3 cited
The Limits of Depth Reduction for Arithmetic Formulas: It's all about the top fan-in
Mrinal Kumar, Shubhangi Saraf
In recent years, a very exciting and promising method for proving lower bounds for arithmetic circuits has been proposed. This method combines the method of {\it depth reduction} d…