1 research outputs found
A Note on Polynomial Identity Testing for Depth-3 Circuits
Let be a depth-3 arithmetic circuit of size at most , computing a
polynomial (where =
or ) and the fan-in of the product gates of is
bounded by . We give a deterministic polynomial identity testing algorithm
to check whether or not in time .Comment: Result for finite fields has been adde