Fast Exact Algorithms Using Hadamard Product of Polynomials

V. Arvind, Abhranil Chatterjee, Rajit Datta +1

Let $C$ be an arithmetic circuit of $poly(n)$ size given as input that computes a polynomial $f\in \mathbb{F}[X]$, where $X=\{x_1,x_2,\dots ,x_n\}$ and $\mathbb{F}$ is any field whe…