7 search results - page 1 / 2 » Non-Commutative Arithmetic Circuits: Depth Reduction and Siz... |
70
Voted
TCS
1998
14 years 10 months ago
1998
FOCS
2008
IEEE
15 years 4 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...
62
Voted
COCO
2008
Springer
15 years 2 days ago
2008
Springer
We prove an exponential lower bound for the size of constant depth multilinear arithmetic circuits computing either the determinant or the permanent (a circuit is called multiline...
84
Voted
CORR
2010
Springer
14 years 10 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...
CSR
2009
Springer
15 years 4 months ago
2009
Springer
We consider the class of constant depth AND/OR circuits augmented with a layer of modular counting gates at the bottom layer, i.e AC0 ◦MODm circuits. We show that the following ...