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
Concentration of the Collision Estimator
Maciej Skorski
- 12 Sep 2021
TL;DR: In this paper, strong concentration properties of the natural collision estimator were established, which counts the number of co-occurrences within a random sample from a discrete distribution, for a given discrete distribution.
1
On Polynomial Approximations to AC^0
Prahladh Harsha,Srikanth Srinivasan +1 more
- 27 Apr 2016
TL;DR: This work shows that any polynomial approximating the OR function on n bits to a small constant error must have degree at least ~Omega(sqrt{log n}) and improves exponentially on a recent lower bound demonstrated by Meka, Nguyen, and Vu.
1
•Posted Content
The Pattern Basis Approach to Circuit Complexity.
TL;DR: It is proved that a "pattern basis" with certain properties would lead to a useful complexity formula of a specific form, and speculate on how to find such a basis.
1
•Posted Content
An improved bound on $\ell_q$ norms of noisy functions
TL;DR: This note proves this inequality for integer $q \ge 2$ with a better (smaller) parameter $\lambda$ and the new inequality is tight for characteristic functions of subcubes.
1
Sharpness of the phase transition for the corrupted compass model on transitive graphs
TL;DR: In this article, the authors study the size of open clusters in the corrupted compass model on a vertex-transitive graph and show that the corresponding phase transition is sharp, i.e., in the subcritical regime, all open clusters are exponentially small, while for large p depending on the underlying graph, there exists an infinite open cluster almost surely.
1
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