computational complexity

, Volume 18, Issue 2, pp 171–207 | Cite as

Lower Bounds and Separations for Constant Depth Multilinear Circuits

Article

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.

Keywords.

Arithmetic circuits constant depth circuits separations 

Subject classification.

68Q17 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Verlag, Basel 2009

Authors and Affiliations

  1. 1.Faculty of Mathematics and Computer ScienceThe Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations