Hardness amplification within NP
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Boolean functions whose Fourier transform is concentrated on the first two levels
Advances in Applied Mathematics
A new multilayered PCP and the hardness of hypergraph vertex cover
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Learning intersections and thresholds of halfspaces
Journal of Computer and System Sciences - Special issue on FOCS 2002
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
On the Hardness of Approximating Multicut and Sparsest-Cut
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Noise stability of functions with low in.uences invariance and optimality
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Nonembeddability theorems via Fourier analysis
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On Non-Approximability for Quadratic Programs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Improved lower bounds for embeddings into L1
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The PCP theorem by gap amplification
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Conditional hardness for approximate coloring
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Testing k-wise and almost k-wise independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Randomly supported independence and resistance
Proceedings of the forty-first annual ACM symposium on Theory of computing
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
Proceedings of the forty-second ACM symposium on Theory of computing
Hi-index | 0.00 |
A theorem of Bourgain [4] on Fourier tails states that if f :(-1, 1)n → (-1, 1) is a boolean-valued function on the discrete cube such that for any k 0, [Σ|S| k f(S)2 -1/2 + o(1), ] then essentially, f depends on only 2O(k) coordinates. This and related theorems such as Friedgut's Theorem [12], KKL [16], the FKN Theorem [14], and the Majority Is Stablest Theorem [27] have proven useful for numerous results in theoretical computer science [3, 5, 9, 6, 7, 10, 11, 18, 19, 20, 24, 17, 25, 23, 22, 28, 29, 31].In this paper we prove an analogue to Bourgain's Theorem for bounded functions on the discrete cube, f : (n ⋺ [-1,1]); such functions arise naturally in hardness-of-approximation problems, as averages of boolean functions. Specifically, we show that for every k 0, if [Σ|S| k f(S)2 2 log k))] then essentially, f depends on only 2O(k) coordinates. We also show, perhaps surprisingly, that this result is sharp up to the log k factor in the exponent.Our proof uses Fourier analysis, as well as some extremal properties of the Chebyshev polynomials.