Analysis of Boolean Functions: List of Notation
Ryan O'Donnell
- 01 Jan 2014
775
TL;DR: Boolean functions are perhaps the most basic objects of study in theoretical computer science.
read more
Abstract: Boolean functions are perhaps the most basic objects of study in theoretical computer science. They also arise in other areas of mathematics, including combinatorics, statistical physics, and mathematical social choice. The field of analysis of Boolean functions seeks to understand them via their Fourier transform and other analytic methods. This text gives a thorough overview of the field, beginning with the most basic definitions and proceeding to advanced topics such as hypercontractivity and isoperimetry. Each chapter includes a "highlight application" such as Arrow's theorem from economics, the Goldreich-Levin algorithm from cryptography/learning theory, Hstad's NP-hardness of approximation results, and "sharp threshold" theorems for random graph properties. The book includes roughly 450 exercises and can be used as the basis of a one-semester graduate course. It should appeal to advanced undergraduates, graduate students, and researchers in computer science theory and related mathematical fields.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors
TL;DR: Andoni et al. as mentioned in this paper showed tight upper and lower bounds for time-space trade-offs for the approximate near neighbor search problem for all space regimes, including Euclidean space and point datasets.
On the $$\Phi $$-stability and related conjectures
TL;DR: In this article , the authors provided several upper bounds for the maximal convex convex function's stability with respect to the Bonami-Beckner operator, and showed that these upper bounds are sharp or asymptotically sharp for certain cases.
Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation)
Tim Roughgarden,Sergei Vassilvitskii,Joshua R. Wang +2 more
- 11 Jul 2016
TL;DR: An abstract model of massively parallel computation, where essentially the only restrictions are that the "fan-in" of each machine is limited to s bits, and that computation proceeds in synchronized rounds, which is proved to be the best one could hope for.
•Posted Content
Gaussian Noise Sensitivity and BosonSampling
Gil Kalai,Guy Kindler +1 more
TL;DR: The sensitivity to noise of |permanent(X)|^2 for random real and complex n x n Gaussian matrices X is studied, and asymptotically the correlation between the noisy and noiseless outcomes tends to zero when the noise level is {\omega}(1)/n.
Fooling Intersections of Low-Weight Halfspaces
Rocco A. Servedio,Li-Yang Tan +1 more
- 01 Oct 2017
TL;DR: The analysis of the PRG fuses techniques from two different lines of work on unconditional pseudorandomness for different kinds of Boolean functions and introduces new coupling-based ingredients into the standard Lindeberg method for establishing quantitative central limit theorems and associated pseudor randomness results.
References
•Book
The Theory of Error-Correcting Codes
F.J. MacWilliams,Neil J. A. Sloane +1 more
- 01 Jan 1977
TL;DR: This book presents an introduction to BCH Codes and Finite Fields, and methods for Combining Codes, and discusses self-dual Codes and Invariant Theory, as well as nonlinear Codes, Hadamard Matrices, Designs and the Golay Code.
12.4K
Über die von der molekularkinetischen Theorie der Wärme geforderte Bewegung von in ruhenden Flüssigkeiten suspendierten Teilchen
TL;DR: In el marco del Proyecto subvencionado by the Fundación Antorchas (FAN) as discussed by the authors, el material was digitalizado, e.g., en la Biblioteca del Departamento de Fisica de la Facultad de Ciencias Exactas de la Universidad Nacional de La Plata.
The Byzantine Generals Problem
TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.
•Book
Functions of Bounded Variation and Free Discontinuity Problems
Luigi Ambrosio,Diego Pallara,Nicola Fusco +2 more
- 01 Jan 2000
TL;DR: The Mumford-Shah functional minimiser of free continuity problems as mentioned in this paper is a special function of the Mumfordshah functional and has been shown to be a function of free discontinuity set.
5.3K