Sciweavers

55
Voted
COCO
2008
Springer
74views Algorithms» more  COCO 2008»
14 years 10 months ago
Lower Bounds and Separations for Constant Depth Multilinear Circuits
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 multiline...
Ran Raz, Amir Yehudayoff