Depth-3 arithmetic circuits over fields of characteristic zero

@article{Shpilka2001Depth3AC,
  title={Depth-3 arithmetic circuits over fields of characteristic zero},
  author={Amir Shpilka and Avi Wigderson},
  journal={computational complexity},
  year={2001},
  volume={10},
  pages={1-27}
}
In this paper we prove quadratic lower bounds for depth-3 arithmetic circuits over fields of characteristic zero. Such bounds are obtained for the elementary symmetric functions, the (trace of) iterated matrix multiplication, and the determinant. As corollaries we get the first nontrivial lower bounds for computing polynomials of constant degree, and a gap between the power of depth-3 arithmetic circuits and depth-4 arithmetic circuits. We also give new shorter formulae of constant depth for… CONTINUE READING
Highly Cited
This paper has 91 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
60 Citations
11 References
Similar Papers

Citations

Publications citing this paper.

91 Citations

051015'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 91 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Private communication

  • M. Ben-Or
  • 1999
Highly Influential
6 Excerpts

A Boolean function

  • E. I. Nečiporuk
  • Soviet Math. Dokl. 7, 999–1000.
  • 1966
Highly Influential
4 Excerpts

The complexity of partial derivatives

  • V. Strassen
  • Theoret . Comput . Sci .
  • 1983
Highly Influential
3 Excerpts

Lower bounds on the size of bounded depth circuits over a complete basis with logical addition

  • A. A. Razborov
  • Math. Notes 41, 333–338.
  • 1987
2 Excerpts

Similar Papers

Loading similar papers…