Highly Influenced

# Lower Bounds and Separations for Constant Depth Multilinear Circuits

@article{Raz2008LowerBA, title={Lower Bounds and Separations for Constant Depth Multilinear Circuits}, author={Ran Raz and Amir Yehudayoff}, journal={Electronic Colloquium on Computational Complexity (ECCC)}, year={2008}, volume={15} }

- Published 2008 in Electronic Colloquium on Computational Complexity
DOI:10.1109/CCC.2008.8

We prove an exponential lower bound for the size of constant depth multilinear arithmetic circuits computing either the determinant or the permanent (a circuit is called multilinear, if the polynomial computed by each of its gates is multilinear). We also prove a super-polynomial separation between the size of product-depth1 d and product-depth d + 1 multilinear circuits (where d is constant). That is, there exists a polynomial f such that • There exists a multilinear circuit of product-depth d… CONTINUE READING

Highly Cited

This paper has 112 citations. REVIEW CITATIONS

#### From This Paper

##### Topics from this paper.

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 112 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**112**citations based on the available data.See our **FAQ** for additional information.