1 research outputs found

    A Note on Polynomial Identity Testing for Depth-3 Circuits

    Full text link
    Let CC be a depth-3 arithmetic circuit of size at most ss, computing a polynomial f∈F[x1,…,xn] f \in \mathbb{F}[x_1,\ldots, x_n] (where F\mathbb{F} = Q\mathbb{Q} or C\mathbb{C}) and the fan-in of the product gates of CC is bounded by dd. We give a deterministic polynomial identity testing algorithm to check whether f≡0f\equiv 0 or not in time 2d poly(n,s) 2^d \text{ poly}(n,s) .Comment: Result for finite fields has been adde
    corecore