Some topics in analysis of boolean functions

Authors:
Ryan O'Donnell
Affiliations:
Carnegie Mellon University, Pittsburgh, PA, USA
Venue:
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Year:
2008

Citing 23
Cited 16

An O(nlog log n) learning algorithm for DNF under the uniform distribution

Journal of Computer and System Sciences
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Approximability of maximum splitting of k-sets and some other Apx-complete problems

Information Processing Letters
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
A Parallel Repetition Theorem

SIAM Journal on Computing
Free Bits, PCPs, and Nonapproximability---Towards Tight Results

SIAM Journal on Computing
Better approximation algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT

Information Processing Letters
Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Some optimal inapproximability results

Journal of the ACM (JACM)
On the power of unique 2-prover 1-round games

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem

Advances in Applied Mathematics
Boolean functions whose Fourier transform is concentrated on the first two levels

Advances in Applied Mathematics
Finite Orthogonal Series in Design of Digital Devices

Finite Orthogonal Series in Design of Digital Devices
Guest column: inapproximability results via Long Code based PCPs

ACM SIGACT News
Agnostically Learning Halfspaces

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
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
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into \ell 1

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
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?

SIAM Journal on Computing
Collective coin flipping, robust voting schemes and minima of Banzhaf values

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
The influence of variables on Boolean functions

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science

Variable Influences in Conjunctive Normal Forms

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Pseudorandom generators for polynomial threshold functions

Proceedings of the forty-second ACM symposium on Theory of computing
An invariance principle for polytopes

Proceedings of the forty-second ACM symposium on Theory of computing
The Fourier entropy-influence conjecture for certain classes of Boolean functions

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Simple and practical algorithm for sparse Fourier transform

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Systems of linear equations over F2 and problems parameterized above average

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Nearly optimal sparse fourier transform

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Improved parameterized algorithms for above average constraint satisfaction

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
New lower bound on max cut of hypergraphs with an application to r-set splitting

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Constraint satisfaction problems parameterized above or below tight bounds: a survey

The Multivariate Algorithmic Revolution and Beyond
Communication: Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width

Discrete Applied Mathematics
An invariance principle for polytopes

Journal of the ACM (JACM)
sMFCC: exploiting sparseness in speech for fast acoustic feature extraction on mobile devices -- a feasibility study

Proceedings of the 14th Workshop on Mobile Computing Systems and Applications
On extremal k-CNF formulas

European Journal of Combinatorics
Optimal Collapsing Protocol for Multiparty Pointer Jumping

Theory of Computing Systems
Approximately classic judgement aggregation

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a brief introduction to Fourier analysis of boolean functions and then discuss some applications: Arrow's Theorem and other ideas from the theory of Social Choice; the Bonami-Beckner Inequality as an extension of Chernoff/Hoeffding bounds to higher-degree polynomials; and, hardness for approximation algorithms.