81 search results - page 1 / 17 » Elusive Functions and Lower Bounds for Arithmetic Circuits |
89
Voted
ECCC
2008
15 years 26 days ago
2008
142
Voted
COCO
1997
Springer
15 years 5 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 ...
82
Voted
COCO
2008
Springer
15 years 2 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...
106
Voted
FOCS
2007
IEEE
15 years 7 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 ...
88
Voted
TCS
1998
15 years 13 days ago
1998
