81 search results - page 1 / 17 » Elusive Functions and Lower Bounds for Arithmetic Circuits |
ECCC
2008
13 years 7 months ago
2008
COCO
1997
Springer
13 years 11 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
COCO
2008
Springer
13 years 9 months ago
2008
Springer
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...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We construct an explicit polynomial f(x1, . . . , xn), with coefficients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least ...
TCS
1998
13 years 7 months ago
1998
