2 search results - page 1 / 1 » Arithmetic circuits: the chasm at depth four gets wider |
CORR
2010
Springer
13 years 11 months ago
2010
Springer
In their paper on the "chasm at depth four", Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which admit arithmetic circuits of size 2o(m) al...
FOCS
2008
IEEE
14 years 5 months ago
2008
IEEE
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for expo...