Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The complexity of Boolean functions
The complexity of Boolean functions
Sorting in c log n parallel steps
Combinatorica
The average sensitivity of bounded-depth circuits
Information Processing Letters
On monotone formulae with restricted depth
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On Approximate Majority and Probabilistic Time
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Approximation by DNF: examples and counterexamples
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Advice coins for classical and quantum computation
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
| Hi-index | 0.00 |
In this paper, we show that for every constant 0 *** d *** 2, the minimum size of a depth d Boolean circuit that *** -approximates Majority function on n variables is exp(*** (n 1/(2d *** 2))). The lower bound for every d *** 2 and the upper bound for d = 2 have been previously shown by O'Donnell and Wimmer [ICALP'07], and the contribution of this paper is to give a matching upper bound for d *** 3.