### Abstract

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-depth 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 + 1 and of polynomial size computing f. Every multilinear circuit of product-depth d computing f has super-polynomial size.

Original language | English (US) |
---|---|

Pages (from-to) | 171-207 |

Number of pages | 37 |

Journal | Computational Complexity |

Volume | 18 |

Issue number | 2 |

DOIs | |

State | Published - Jun 2009 |

Externally published | Yes |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Mathematics(all)
- Computational Theory and Mathematics
- Computational Mathematics

### Keywords

- Arithmetic circuits
- Constant depth circuits
- Separations

## Fingerprint Dive into the research topics of 'Lower bounds and sparations for constant depth multilinear circuits'. Together they form a unique fingerprint.

## Cite this

Raz, R., & Yehudayoff, A. (2009). Lower bounds and sparations for constant depth multilinear circuits.

*Computational Complexity*,*18*(2), 171-207. https://doi.org/10.1007/s00037-009-0270-8