A Note on Polynomial Identity Testing for Depth-3 Circuits

V. Arvind, Abhranil Chatterjee, Rajit Datta +1

Let $C$ be a depth-3 arithmetic circuit of size at most $s$, computing a polynomial $f\in \mathbb{F}[x_1,\dots ,x_n]$ (where $\mathbb{F}$ = $\mathbb{Q}$ or $\mathbb{C}$) and th…