A brief introduction to Fourier analysis on the Boolean cube

A brief introduction to Fourier analysis on the Boolean cube (2008)

Cached

Download Links

[theoryofcomputing.org]
[homepages.cwi.nl]

Other Repositories/Bibliography

DBLP

by Ronald De Wolf

Venue:	Theory of Computing Library– Graduate Surveys
Citations:	11 - 1 self

BibTeX

@ARTICLE{Wolf08abrief,
    author = {Ronald De Wolf},
    title = {A brief introduction to Fourier analysis on the Boolean cube},
    journal = {Theory of Computing Library– Graduate Surveys},
    year = {2008}
}

Bookmark

OpenURL

Abstract

Abstract: We give a brief introduction to the basic notions of Fourier analysis on the

Citations

1605	The Theory of Error-Correcting Codes - MacWilliams, Sloane - 1978
1346	Rényi A: On random graphs - Erdös - 1959
605	Proof Verification and the Hardness of Approximation Problems - Arora, Lund, et al. - 1998
324	Fast Probabilistic Algorithms for Verification of Polynomial Identities - Schwartz - 1980
292	L.: A Hard-Core Predicate for all One-Way Functions - Goldreich, Levin - 1989
253	Constant Depth Circuits, Fourier Transform, and Learnability - Linial, Mansour, et al. - 1993
190	The influence of variables on Boolean functions - Kahn, Kalai, et al. - 1988
181	On the power of unique 2-Prover 1-Round games - Khot - 2002
172	Logarithmic sobolev inequalities - Gross - 1975
155	Learning Decision Trees using the Fourier Spectrum - Kushilevitz, Mansour - 1993
150	An efficient membership-query algorithm for learning dnf with respect to the uniform distribution - Jackson - 1994
133	Optimal Inapproximability Results for MAX-CUT and Other 2-variable CSPs - Khot, Kindler, et al.
126	On the degree of Boolean functions as real polynomials - Nisan, Szegedy - 1994
121	Every monotone graph property has a sharp threshold - Friedgut, Kalai - 1996
112	Inequalities in fourier analysis - Beckner - 1975
101	VISHNOI: The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into ℓ1 - KHOT, NISHEETH - 2005
95	Complexity measures and decision tree complexity: A survey - Buhrman, Wolf - 2004
92	Vertex cover might be hard to approximate to within 2 − ǫ - Khot, Regev
89	The PCP theorem by gap amplification - Dinur - 2007
71	A difficulty in the concept of social welfare - Arrow - 1950
58	Embedding the diamond graph in Lp and dimension reduction in L1 - Lee, Naor - 1995
52	Boolean functions with low average sensitivity depend on few coordinates - Friedgut - 1998
48	Optimal algorithms and inapproximability results for every CSP - Raghavendra - 2008
43	The influence of variables in product spaces - Bourgain, Kahn, et al. - 1992
39	Elections can be manipulated often - Friedgut, Kalai, et al. - 2008
38	An O(n log log n ) learning algorithm for DNF under the uniform distribution - Mansour - 1995
36	Testing juntas - Fischer, Kindler, et al.
35	Lower bounds for quantum communication complexity - Klauck
34	On the distributions of the Fourier spectrum of Boolean functions - Bourgain
33	Etude des coefficients de Fourier des fonctions de L p - Bonami - 1970
31	On computation and communication with small bias - Buhrman, Vereshchagin, et al. - 2007
27	Fourier analysis for probabilistic communication complexity - Raz - 1995
25	Collective coin flipping, robust voting schemes and minima of Banzhaf values - Ben-Or, Linial - 1985
25	Krzysztof Oleszkiewicz. Noise Stability of Functions With Low Influences: Invariance and Optimality - Mossel, O’Donnell
23	Boolean functions whose Fourier transform is concentrated on the first two levels - Friedgut, Kalai, et al.
19	Learning functions of k relevant variables - Mossel, O’Donnell, et al. - 2004
19	Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables - Shi - 2000
19	Gaussian Hilbert spaces, volume 129 of Cambridge Tracts in Mathematics - Janson - 1997
18	SDP gaps and UGC-hardness for MAXCUTGAIN - Khot, O’Donnell
17	Learning monotone decision trees in polynomial time - O’Donnell, Servedio - 2005
16	Learning DNF in time 2 - Klivans, Servedio - 2001
16	Extremal properties of polynomial threshold functions - O’Donnell, Servedio
15	A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs - Ben-Aroya, Regev, et al. - 2008
14	Testing k-wise and almost k-wise independence - Alon, Andoni, et al. - 2007
14	Communication lower bounds using dual polynomials, Bulletin of - Sherstov
13	Complexity Theory: A Modern Approach - Arora, Barak - 2009
13	Some topics in analysis of boolean functions - O’DONNELL - 2008
13	Every linear threshold function has a low-weight approximator - Servedio - 2006
12	Every decision tree has an influential variable - O’Donnell, Saks, et al. - 2005
12	Learning dnf from random walks - Bshouty, Mossel, et al. - 2005