107 search results - page 2 / 22 » Fixed-Polynomial Size Circuit Bounds |
PATMOS
2005
Springer
13 years 11 months ago
2005
Springer
Early circuit performance estimation and easy-to-apply methods for minimum-delay gate sizing are needed, in order to enhance circuit’s performance and to increase designers’ pr...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
FOCS
2007
IEEE
13 years 11 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 5 months ago
1998
APPROX
2008
Springer
13 years 7 months ago
2008
Springer