Sciweavers

ICALP
2009
Springer
15 years 4 days ago
Bounds on the Size of Small Depth Circuits for Approximating Majority
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 ...
Kazuyuki Amano