At a high level, Koiran's depth reduction applies for arithmetic branching programs, which also yields a depth reduction for general arithmetic circuits with.

Abstract: We show that, over Q, if an n-variate polynomial of degree d = n O(1) is computable by an arithmetic circuit of size s (respectively by an ...

Feb 27, 2013 · The ΣΠΣ circuits that we construct have the property that (some of) the intermediate polynomials have degree much higher than d.

In this paper we show that lower bounds for bounded depth arithmetic circuits imply derandomization of polynomial identity testing for bounded depth arithmetic ...

Mar 5, 2013 · The circuits that we construct have the property that (some of) the intermediate polynomials have degree much higher than d. Indeed such a ...

ΣΠΣ circuits (more specifically tensors) arise naturally in the investigation of the complexity of polynomial multiplication and matrix multipli- cation6.

We show that, over Q, if an n-variate polynomial of degree d = nO(1) is computable by an arithmetic circuit of size s (respectively by an arithmetic ...

We show that, over ${\mathbb Q}$, if an $n$-variate polynomial of degree $d = n^{O(1)}$ is computable by an arithmetic circuit of size $s$.

Missing: Three. | Show results with:Three.

Arithmetic Circuits: A Chasm at Depth Three · Ankit Gupta, Pritish Kamath, +1 author. Ramprasad Saptharishi · Published in IEEE Annual Symposium on… 26 October ...