Threshold functions and bounded depth monotone circuits
Journal of Computer and System Sciences
Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
Sorting in c log n parallel steps
Combinatorica
Poceedings of the London Mathematical Society symposium on Boolean function complexity
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
On the Fourier spectrum of monotone functions
Journal of the ACM (JACM)
The harmonic sieve: a novel application of Fourier analysis to machine learning theory and practice
The harmonic sieve: a novel application of Fourier analysis to machine learning theory and practice
The average sensitivity of bounded-depth circuits
Information Processing Letters
Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
Learning Monotone Decision Trees in Polynomial Time
SIAM Journal on Computing
The influence of variables on Boolean functions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Monotone circuits for the majority function
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Variable Influences in Conjunctive Normal Forms
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Bounds on the Size of Small Depth Circuits for Approximating Majority
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
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 |
Say that f : {0, 1}n → {0, 1} ε-approximates g : {0, 1}n → {0, 1} if the functions disagree on at most an ε fraction of points. This paper contains two results about approximation by DNF and other smalldepth circuits: (1) For every constant 0 O√n that ε-approximates the Majority function on n bits, and this is optimal up to the constant in the exponent. (2) There is a monotone function F : {0, 1}n → {0, 1} with total influence (AKA average sensitivity) I(F) ≤ O(log n) such that any DNF or CNF that.01-approximates F requires size 2Ω(n/ log n) and such that any unbounded fan-in AND-OR-NOT circuit that .01-approximates F requires size Ω(n/ log n). This disproves a conjecture of Benjamini, Kalai, and Schramm (appearing in [BKS99, Kal00, KS05]).