Name
Abstract | ||
|---|---|---|
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 2^o^(^m^) also admit arithmetic circuits of depth four and size 2^o^(^m^). This theorem shows that for problems such as arithmetic circuit lower bounds or black-box derandomization of identity testing, the case of depth four circuits is in a certain sense the general case. In this paper we show that smaller depth four circuits can be obtained if we start from polynomial size arithmetic circuits. For instance, we show that if the permanent of nxn matrices has circuits of size polynomial in n, then it also has depth 4 circuits of size n^O^(^n^l^o^g^n^). If the original circuit uses only integer constants of polynomial size, then the same is true for the resulting depth four circuit. These results have potential applications to lower bounds and deterministic identity testing, in particular for sums of products of sparse univariate polynomials. We also use our techniques to reprove two results on: -the existence of nontrivial boolean circuits of constant depth for languages in LOGCFL; -reduction to polylogarithmic depth for arithmetic circuits of polynomial size and polynomially bounded degree. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.tcs.2012.03.041 | Theoretical Computer Science |
Keywords | DocType | Volume |
arithmetic circuit,polynomial size arithmetic circuit,size polynomial,resulting depth,smaller depth,size n,constant depth,polynomial size,arithmetic circuit lower bound,sparse univariate polynomial,computational complexity,boolean circuits,sum of products,lower bound | Journal | 448, |
ISSN | Citations | PageRank |
0304-3975 | 53 | 1.95 |
References | Authors | |
20 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pascal Koiran | 1 | 919 | 113.85 |