Analysis of Boolean Functions

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.

[1]  F. G. Mehler.  Ueber die Entwicklung einer Function von beliebig vielen Variablen nach Laplaceschen Functionen höherer Ordnung. , 1866 .

[2]  J. Rousseau,et al.  Du contrat social , 1896 .

[3]  W. Sheppard.  On the Application of the Theory of Error to Cases of Normal Distribution and Normal Correlation , 1899 .

[4]  L. Dickson.  Linear groups with an exposition of the Galois field theory / by Leonard Eugene Dickson. , 1901 .

[5]  L. Dickson,et al.  Linear Groups: With an Exposition of the Galois Field Theory , 1902 .

[6]  A. Einstein.  Über die von der molekularkinetischen Theorie der Wärme geforderte Bewegung von in ruhenden Flüssigkeiten suspendierten Teilchen [AdP 17, 549 (1905)] , 2005, Annalen der Physik.

[7]  A. Haar.  Zur Theorie der orthogonalen Funktionensysteme , 1910 .

[8]  J. Lindeberg.  Eine neue Herleitung des Exponentialgesetzes in der Wahrscheinlichkeitsrechnung , 1922 .

[9]  J. Walsh.  A Closed Set of Normal Orthogonal Functions , 1923 .

[10]  G. Uhlenbeck,et al.  On the Theory of the Brownian Motion , 1930 .

[11]  R. Paley.  A Remarkable Series of Orthogonal Functions (I) , 1932 .

[12]  J. Hadamard,et al.  Leçons D'Analyse Fonctionnelle , 1934, The Mathematical Gazette.

[13]  Claude E. Shannon,et al.  A symbolic analysis of relay and switching circuits , 1938, Transactions of the American Institute of Electrical Engineers.

[14]  A. C. Berry.  The accuracy of the Gaussian approximation to the sum of independent variates , 1941 .

[15]  L. Penrose.  The Elementary Statistics of Majority Voting , 1946 .

[16]  R. V. Mises.  On the Asymptotic Distribution of Differentiable Statistical Functions , 1947 .

[17]  C. R. Rao,et al.  Factorial Experiments Derivable from Combinatorial Arrangements of Arrays , 1947 .

[18]  W. Hoeffding.  A Class of Statistics with Asymptotically Normal Distribution , 1948 .

[19]  E. Schmidt.  Die Brunn-Minkowskische Ungleichung und ihr Spiegelbild sowie die isoperimetrische Eigenschaft der Kugel in der euklidischen und nichteuklidischen Geometrie. I , 1948 .

[20]  N. Fine.  On the Walsh functions , 1949 .

[21]  K. Arrow.  A Difficulty in the Concept of Social Welfare , 1950, Journal of Political Economy.

[22]  K. Arrow,et al.  Social Choice and Individual Values , 1951 .

[23]  Kenneth O. May,et al.  A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision , 1952 .

[24]  L. S. Shapley,et al.  17. A Value for n-Person Games , 1953 .

[25]  K. F. Roth.  On Certain Sets of Integers , 1953 .

[26]  David E. Muller,et al.  Application of Boolean algebra to switching circuit design and to error detection , 1954, Trans. I R E Prof. Group Electron. Comput..

[27]  D. E. Muller.  Boolean Algebras in Electric Circuit Design , 1954 .

[28]  J. Hammersley,et al.  Percolation processes , 1957, Mathematical Proceedings of the Cambridge Philosophical Society.

[29]  J. H. Blau.  THE EXISTENCE OF SOCIAL WELFARE FUNCTIONS , 1957 .

[30]  H. Trotter.  Approximation of semi-groups of operators , 1958 .

[31]  Solomon W. Golomb,et al.  On the classification of Boolean functions , 1959, IRE Trans. Inf. Theory.

[32]  Calvin C. Elgot,et al.  Truth functions realizable by single threshold organs , 1961, SWCT.

[33]  W. Riker.  Voting and the Summation of Preferences: An interpretive Bibliographical Review of Selected Developments During the Last Decade , 1961 .

[34]  C. K. Chow,et al.  On the characterization of threshold functions , 1961, SWCT.

[35]  W. Rudin,et al.  Fourier Analysis on Groups. , 1965 .

[36]  R. Titsworth.  Correlation properties of cyclic sequences , 1962 .

[37]  R. Titsworth.  Optimal Ranging Codes , 1964, IEEE Transactions on Space Electronics and Telemetry.

[38]  L. H. Harper.  Optimal Assignments of Numbers to Vertices , 1964 .

[39]  D. Kleitman.  Families of Non-disjoint subsets* , 1966 .

[40]  Sadahiro Saeki.  On norms of idempotent measures. II , 1968 .

[41]  M. Kamien,et al.  The paradox of voting: probability calculations. , 1968, Behavioral science.

[42]  J. Glimm.  Boson fields with nonlinear selfinteraction in two dimensions , 1968 .

[43]  J. Hájek,et al.  Asymptotic Normality of Simple Linear Rank Statistics Under Alternatives II , 1968 .

[44]  A. Bonami.  Ensembles $\Lambda (p)$ dans le dual de $D^\infty $ , 1968 .

[45]  P. Federbush.  Partially Alternate Derivation of a Result of Nelson , 1969 .

[46]  M. Schreiber.  Fermeture en probabilité de certains sous-espaces d'un espace L2 , 1969 .

[47]  P. Enflo.  On the nonexistence of uniform homeomorphisms betweenLp-spaces , 1970 .

[48]  I. Segal.  Construction of Non-Linear Local Quantum Processes: I , 1970 .

[49]  A. Bonami.  Étude des coefficients de Fourier des fonctions de $L^p(G)$ , 1970 .

[50]  Robert J. Lechner.  HARMONIC ANALYSIS OF SWITCHING FUNCTIONS , 1971 .

[51]  B. Simon,et al.  Hypercontractive semigroups and two dimensional self-coupled Bose fields , 1972 .

[52]  L. Gross.  Existence and uniqueness of physical ground states , 1972 .

[53]  C. Stein.  A bound for the error in the normal approximation to the distribution of a sum of dependent random variables , 1972 .

[54]  Edward Nelson.  The free Markoff field , 1973 .

[55]  A. I. Rubinshtein,et al.  Series with respect to the Walsh system and their generalizations , 1973 .

[56]  H. McKean.  Geometry of Differential Space , 1973 .

[57]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[58]  V. Rotaŕ.  Some Limit Theorems for Polynomials of Second Degree , 1974 .

[59]  W. Beckner.  Inequalities in Fourier analysis , 1975 .

[60]  C. Borell.  The Brunn-Minkowski inequality in Gauss space , 1975 .

[61]  L. Gross.  LOGARITHMIC SOBOLEV INEQUALITIES. , 1975 .

[62]  V. Rotaŕ.  Limit Theorems for Multilinear Forms and Quasipolynomial Functions , 1976 .

[63]  E. Lieb,et al.  Best Constants in Young's Inequality, Its Converse, and Its Generalization to More than Three Functions , 1976 .

[64]  B. A. Taylor,et al.  Spherical rearrangements, subharmonic functions, and $\ast$-functions in $n$-space , 1976 .

[65]  O. S. Rothaus,et al.  On "Bent" Functions , 1976, J. Comb. Theory, Ser. A.

[66]  S. Szarek.  On the best constants in the Khinchin inequality , 1976 .

[67]  J. Neveu.  Sur l'espérance conditionnelle par rapport à un mouvement brownien , 1976 .

[68]  T. Figiel,et al.  The dimension of almost spherical sections of convex bodies , 1976 .

[69]  Mark G. Karpovsky,et al.  Finite Orthogonal Series in the Design of Digital Devices: Analysis, Synthesis and Optimization , 1976 .

[70]  Robert J. McEliece,et al.  New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities , 1977, IEEE Trans. Inf. Theory.

[71]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[72]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[73]  V. Sudakov,et al.  Extremal properties of half-spaces for spherically invariant measures , 1978 .

[74]  J. Zinn,et al.  On the limit theorems for random variables with values in the spaces Lp (2≦p<∞) , 1978 .

[75]  F. Weissler.  Two-point inequalities, the Hermite semigroup and the Gauss-Weierstrass semigroup , 1979 .

[76]  F. Clarke,et al.  GROSS'S LOGARITHMIC SOBOLEV INEQUALITY: A SIMPLE PROOF , 1979 .

[77]  V. Rotaŕ,et al.  Limit theorems for polylinear forms , 1979 .

[78]  Rusins Freivalds,et al.  Fast Probabilistic Algorithms , 1979, MFCS.

[79]  C. Borell.  On the integrability of Banach space valued Walsh polynomials , 1979 .

[80]  F. Weissler.  Logarithmic Sobolev inequalities and hypercontractive estimates on the circle , 1980 .

[81]  H. Rubin,et al.  Asymptotic Distribution of Symmetric Statistics , 1980 .

[82]  U. Haagerup.  The best constants in the Khintchine inequality , 1981 .

[83]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[84]  B. Efron,et al.  The Jackknife Estimate of Variance , 1981 .

[85]  L. Russo.  On the critical percolation probabilities , 1981 .

[86]  S. Karlin,et al.  Applications of Anova Type Decompositions for Comparisons of Conditional Variance Statistics Including Jackknife Estimates , 1982 .

[87]  J. Muzio,et al.  Spectral method of Boolean function complexity , 1982 .

[88]  C. Borell.  Positivity improving operators and hypercontractivity , 1982 .

[89]  L. Russo.  An approximate zero-one law , 1982 .

[90]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[91]  A. Ehrhard.  Symétrisation dans l'espace de Gauss. , 1983 .

[92]  A. Takemura.  Tensor Analysis of ANOVA Decomposition , 1983 .

[93]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[94]  P. Hall,et al.  STEIN'S METHOD AND THE BERRY‐ESSÉEN THEOREM , 1984 .

[95]  R. A. Vitale.  An expansion for symmetric statistics and the Efron-Stein inequality , 1984 .

[96]  E. Bolthausen.  An estimate of the remainder in a combinatorial central limit theorem , 1984 .

[97]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, CACM.

[98]  Thomas Siegenthaler,et al.  Correlation-immunity of nonlinear combining functions for cryptographic applications , 1984, IEEE Trans. Inf. Theory.

[99]  A. Ehrhard.  Inégalités isopérimétriques et intégrales de Dirichlet gaussiennes , 1984 .

[100]  Béla Bollobás,et al.  Random Graphs , 1985 .

[101]  J. Kahane.  Some Random Series of Functions , 1985 .

[102]  Nathan Linial,et al.  Collective coin flipping, robust voting schemes and minima of Banzhaf values , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[103]  C. Borell.  Geometric bounds on the Ornstein-Uhlenbeck velocity process , 1985 .

[104]  Oded Goldreich,et al.  The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[105]  A. Yao.  Separating the polynomial-time hierarchy by oracles , 1985 .

[106]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[107]  Michael E. Saks,et al.  Probabilistic Boolean decision trees and the complexity of evaluating game trees , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[108]  J. Steele.  An Efron-Stein inequality for nonsymmetric statistics , 1986 .

[109]  G. Pisier.  Probabilistic methods in the geometry of Banach spaces , 1986 .

[110]  C. Stein.  Approximate computation of expectations , 1986 .

[111]  Manuel Blum,et al.  Generic oracles and oracle classes , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[112]  J. Håstad.  Computational limitations of small-depth circuits , 1987 .

[113]  Béla Bollobás,et al.  Threshold functions , 1987, Comb..

[114]  David Haussler,et al.  Occam's Razor , 1987, Inf. Process. Lett..

[115]  A. Thomason.  Pseudo-Random Graphs , 1987 .

[116]  D. Freedman,et al.  A dozen de Finetti-style results in search of a theory , 1987 .

[117]  James L. Massey,et al.  A spectral characterization of correlation-immune combining functions , 1988, IEEE Trans. Inf. Theory.

[118]  Benny Chor,et al.  On the Influence of Single Participant in Coin Flipping Schemes , 1988, SIAM J. Discret. Math..

[119]  J. Szulga,et al.  Hypercontraction principle and random multilinear forms , 1988 .

[120]  Nathan Linial,et al.  The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[121]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.

[122]  J. Epperson.  The hypercontractive approach to exactly bounding an operator with complex Gaussian kernel , 1989 .

[123]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[124]  M. Talagrand.  A conjecture on convolution operators, and a non-Dunford-Pettis operator onL1 , 1989 .

[125]  Fan Chung Graham,et al.  Quasi-random graphs , 1988, Comb..

[126]  Gábor Tardos,et al.  Query complexity, or why is it difficult to separateNPA∩coNPA fromPA by random oraclesA? , 1989, Comb..

[127]  Nathan Linial,et al.  Collective Coin Flipping , 1989, Adv. Comput. Res..

[128]  Alon Orlitsky,et al.  A Spectral Lower Bound Techniqye for the Size of Decision Trees and Two Level AND/OR Circuits , 1990, IEEE Trans. Computers.

[129]  Jehoshua Bruck,et al.  Harmonic Analysis of Polynomial Threshold Functions , 1990, SIAM J. Discret. Math..

[130]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[131]  E. Carlen,et al.  Extremals of functionals with competing symmetries , 1990 .

[132]  Sean W. Smith,et al.  Improved learning of AC0 functions , 1991, COLT '91.

[133]  L. Shapley,et al.  The Shapley Value , 1994 .

[134]  Eyal Kushilevitz,et al.  Learning decision trees using the Fourier spectrum , 1991, STOC '91.

[135]  Jehoshua Bruck,et al.  On The Power Of Threshold Circuits With Small Weights , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[136]  Yishay Mansour,et al.  An O(nlog log n) learning algorithm for DNF under the uniform distribution , 1992, COLT '92.

[137]  Noga Alon,et al.  Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.

[138]  R. Graham,et al.  Quasi-random subsets of Z n , 1992 .

[139]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[140]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 1992, STOC '92.

[141]  M. Ledoux.  On an integral criterion for hypercontractivity of diffusion semigroups and extremal functions , 1992 .

[142]  W. Beckner.  Sobolev inequalities, the Poisson semigroup, and analysis on the sphere Sn. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[143]  S. Kwapień,et al.  Random Series and Stochastic Integrals: Single and Multiple , 1992 .

[144]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

[145]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[146]  Ron Holzman,et al.  On the product of sign vectors and unit vectors , 1992, Comb..

[147]  Jehoshua Bruck,et al.  Polynomial threshold functions, AC functions and spectrum norms , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[148]  N. Linial,et al.  The influence of variables in product spaces , 1992 .

[149]  Keith Ball.  The reverse isoperimetric problem for Gaussian measure , 1993, Discret. Comput. Geom..

[150]  Moni Naor,et al.  Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..

[151]  Nathan Linial,et al.  The influence of large coalitions , 1993, Comb..

[152]  M. Talagrand.  Isoperimetry, logarithmic sobolev inequalities on the discrete cube, and margulis' graph connectivity theorem , 1993 .

[153]  Avi Wigderson,et al.  Deterministic approximate counting of depth-2 circuits , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[154]  Michael Kharitonov,et al.  Cryptographic hardness of distribution-specific learning , 1993, STOC.

[155]  Charles Delorme,et al.  Laplacian eigenvalues and the maximum cut problem , 1993, Math. Program..

[156]  M. Ledoux.  Semigroup proofs of the isoperimetric inequality in Euclidean and Gauss space , 1994 .

[157]  David P. Williamson,et al.  .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.

[158]  D. Bakry.  L'hypercontractivité et son utilisation en théorie des semigroupes , 1994 .

[159]  Yishay Mansour,et al.  Learning Boolean Functions via the Fourier Transform , 1994 .

[160]  P. Beame.  A switching lemma primer , 1994 .

[161]  M. Talagrand.  On Russo's Approximate Zero-One Law , 1994 .

[162]  Nathan Linial,et al.  Spectral properties of threshold functions , 1994, Comb..

[163]  Jeffrey C. Jackson,et al.  An efficient membership-query algorithm for learning DNF with respect to the uniform distribution , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[164]  R. Latala,et al.  On the best constant in the Khinchin-Kahane inequality , 1994 .

[165]  Madhu Sudan,et al.  Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[166]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[167]  Mihir Bellare,et al.  Linearity testing in characteristic two , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[168]  Noam Nisan,et al.  On rank vs. communication complexity , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[169]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[170]  Nader H. Bshouty,et al.  On the Fourier spectrum of monotone functions , 1995, STOC '95.

[171]  A. Razborov.  Bounded Arithmetic and Lower Bounds in Boolean Complexity , 1995 .

[172]  Johan Håstad.  Testing of the long code and hardness for clique , 1996, STOC '96.

[173]  Michel Talagrand,et al.  How much are increasing sets positively correlated? , 1996, Comb..

[174]  P. Diaconis,et al.  LOGARITHMIC SOBOLEV INEQUALITIES FOR FINITE MARKOV CHAINS , 1996 .

[175]  G. Kalai,et al.  Every monotone graph property has a sharp threshold , 1996 .

[176]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.

[177]  M. Ledoux,et al.  Isoperimetry and Gaussian analysis , 1996 .

[178]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[179]  Luca Trevisan,et al.  Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[180]  M. Ledoux,et al.  Lévy–Gromov’s isoperimetric inequality for an infinite dimensional diffusion generator , 1996 .

[181]  Howard J. Karloff,et al.  How good is the Goemans-Williamson MAX CUT algorithm? , 1996, STOC '96.

[182]  J. C. Jackson.  The harmonic sieve: a novel application of Fourier analysis to machine learning theory and practice , 1996 .

[183]  S. Janson.  Gaussian Hilbert Spaces , 1997 .

[184]  Ravi B. Boppana,et al.  The Average Sensitivity of Bounded-Depth Circuits , 1997, Inf. Process. Lett..

[185]  Uri Zwick,et al.  A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[186]  S. Bobkov.  An isoperimetric inequality on the discrete cube, and an elementary proof of the isoperimetric inequality in Gauss space , 1997 .

[187]  Elton P. Hsu,et al.  Martingale Representation and a Simple Proof of Logarithmic Sobolev Inequalities on Path Spaces , 1997 .

[188]  Pavel Pudlák,et al.  On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates , 1997, Theor. Comput. Sci..

[189]  J. Bourgain.  On Sharp Thresholds of Monotone Properties , 1997 .

[190]  M. Ledoux.  A Short Proof of the Gaussian Isoperimetric Inequality , 1998 .

[191]  Mihir Bellare,et al.  Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

[192]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[193]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[194]  Ehud Friedgut,et al.  Boolean Functions With Low Average Sensitivity Depend On Few Coordinates , 1998, Comb..

[195]  I. Benjamini,et al.  Noise sensitivity of Boolean functions and applications to percolation , 1998, math/9811157.

[196]  S. Bobkov,et al.  On Modified Logarithmic Sobolev Inequalities for Bernoulli and Poisson Measures , 1998 .

[197]  J. Szulga.  Introduction to Random Chaos , 1998 .

[198]  J. Bourgain.  Global wellposedness of defocusing critical nonlinear Schrödinger equation in the radial case , 1999 .

[199]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[200]  Ronitt Rubinfeld,et al.  Fast approximate PCPs , 1999, STOC '99.

[201]  E. Friedgut,et al.  Sharp thresholds of graph properties, and the -sat problem , 1999 .

[202]  Uri Zwick,et al.  Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems , 1999, STOC '99.

[203]  Bruno Codenotti,et al.  Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem , 1999, IEEE Trans. Computers.

[204]  S. Bobkov,et al.  Discrete isoperimetric and Poincaré-type inequalities , 1999 .

[205]  A. Terras.  Fourier Analysis on Finite Groups and Applications: Index , 1999 .

[206]  D. Achlioptas,et al.  A sharp threshold for k-colorability , 1999 .

[207]  Noga Alon,et al.  Bipartite Subgraphs and the Smallest Eigenvalue , 2000, Combinatorics, Probability and Computing.

[208]  Luca Trevisan,et al.  The Approximability of Constraint Satisfaction Problems , 2001, SIAM J. Comput..

[209]  Lars Engebretsen,et al.  Clique Is Hard To Approximate Within , 2000 .

[210]  L. Ambrosio,et al.  Functions of Bounded Variation and Free Discontinuity Problems , 2000 .

[211]  Alexander Russell,et al.  Spectral Bounds on General Hard Core Predicates , 2000, STACS.

[212]  B. Maurey,et al.  Institute for Mathematical Physics Some Remarks on Isoperimetry of Gaussian Type Some Remarks on Isoperimetry of Gaussian Type , 2022 .

[213]  Gilles Zémor,et al.  Discrete Isoperimetric Inequalities and the Probability of a Decoding Error , 2000, Combinatorics, Probability and Computing.

[214]  F. Nazarov,et al.  Ball, Haagerup, and Distribution Functions , 2000 .

[215]  W. T. Gowers,et al.  A new proof of Szemerédi's theorem , 2001 .

[216]  Noga Alon,et al.  Constructing worst case instances for semidefinite programming based approximation algorithms , 2001, SODA '01.

[217]  Johan Håstad,et al.  A Slight Sharpening of LMN , 2001, J. Comput. Syst. Sci..

[218]  Y. Rinott,et al.  A remark on quadrant normal probabilities in high dimensions , 2001 .

[219]  Sanjeev Khanna,et al.  Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.

[220]  A. Volberg,et al.  ASZ-SIMONOVITS LEMMA, DIMENSION-FREE ESTIMATES FOR VOLUMES OF SUBLEVEL SETS OF POLYNOMIALS, AND DISTRIBUTION OF ZEROES OF RANDOM ANALYTIC FUNCTIONS. , 2001, math/0108212.

[221]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[222]  Dana Ron,et al.  Proclaiming Dictators and Juntas or Testing Boolean Formulae , 2001, RANDOM-APPROX.

[223]  A. Carbery,et al.  Distributional and L-q norm inequalities for polynomials over convex bodies in R-n , 2001 .

[224]  Assaf Naor,et al.  Boolean functions whose Fourier transform is concentrated on the first two levels , 2002, Adv. Appl. Math..

[225]  Uriel Feige,et al.  On the optimality of the random hyperplane rounding technique for MAX CUT , 2002, Random Struct. Algorithms.

[226]  Dana Ron,et al.  Testing Basic Boolean Formulae , 2002, SIAM J. Discret. Math..

[227]  Uri Zwick,et al.  Computer assisted proof of optimal approximability results , 2002, SODA '02.

[228]  Gil Kalai,et al.  A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem , 2002, Adv. Appl. Math..

[229]  Subhash Khot.  On the power of unique 2-prover 1-round games , 2002, STOC '02.

[230]  K. Oleszkiewicz.  On a Nonsymmetric Version of the Khinchine-Kahane Inequality , 2003 .

[231]  Eli Ben-Sasson,et al.  Randomness-efficient low degree tests and short PCPs via epsilon-biased sets , 2003, STOC '03.

[232]  S. Safra,et al.  Noise-Resistant Boolean-Functions are Juntas , 2003 .

[233]  Ravi Kumar,et al.  Two applications of information complexity , 2003, STOC '03.

[234]  F. Nazarov.  On the Maximal Perimeter of a Convex Set in $ ℝ n $$\mathbb{R}^n$ with Respect to a Gaussian Measure , 2003 .

[235]  Ryan O'Donnell,et al.  Extremal properties of polynomial threshold functions , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[236]  Ke Yang,et al.  On the (im)possibility of non-interactive correlation distillation , 2004, Theor. Comput. Sci..

[237]  Avrim Blum.  Learning a Function of r Relevant Variables , 2003, COLT.

[238]  R. O'Donnell,et al.  Computational applications of noise sensitivity , 2003 .

[239]  Martin Raič,et al.  Normal Approximation by Stein ’ s Method , 2003 .

[240]  Adam R. Klivans,et al.  Learning intersections and thresholds of halfspaces , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[241]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[242]  Assaf Naor,et al.  The two possible values of the chromatic number of a random graph , 2004, STOC '04.

[243]  Moses Charikar,et al.  Maximizing quadratic programs: extending Grothendieck's inequality , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[244]  Eli Ben-Sasson,et al.  Robust pcps of proximity, shorter pcps and applications to coding , 2004, STOC '04.

[245]  Elchanan Mossel,et al.  Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality , 2004, math/0410560.

[246]  Ryan O'Donnell,et al.  Learning functions of k relevant variables , 2004, J. Comput. Syst. Sci..

[247]  D. V. Pasechnik,et al.  On approximate graph colouring and MAX-k-CUT algorithms based on the theta-function , 2002 .

[248]  Gatis Midrijanis.  Exact quantum query complexity for total Boolean functions , 2004, quant-ph/0403168.

[249]  Y. Peres.  Noise Stability of Weighted Majority , 2004, math/0412377.

[250]  Omer Reingold,et al.  Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem , 2004, FOCS.

[251]  Ryan O'Donnell,et al.  Hardness amplification within NP , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[252]  P. Müller.  Isomorphisms Between H¹ Spaces , 2005 .

[253]  O. Schramm,et al.  Quantitative noise sensitivity and exceptional times for percolation , 2005, math/0504586.

[254]  Nisheeth K. Vishnoi,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into 1 (Extended Abstract) , 2005 .

[255]  Nisheeth K. Vishnoi,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.

[256]  Ryan O'Donnell,et al.  Coin flipping from a cosmic source: On error correction of truly random bits , 2004, Random Struct. Algorithms.

[257]  V. Bentkus.  A Lyapunov-type Bound in Rd , 2005 .

[258]  Ryan O'Donnell,et al.  Every decision tree has an influential variable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[259]  Ryan O'Donnell,et al.  Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[260]  Guy Kindler,et al.  On non-approximability for quadratic programs , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[261]  Troy Lee,et al.  The Quantum Adversary Method and Classical Formula Size Lower Bounds , 2005, Computational Complexity Conference.

[262]  Subhash Khot.  Guest column: inapproximability results via Long Code based PCPs , 2005, SIGA.

[263]  E. Friedgut.  Hunting for sharp thresholds , 2005 .

[264]  David Bruce Wilson,et al.  Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read , 2004, STOC '05.

[265]  D. Pallara,et al.  Short-time heat flow and functions of bounded variation in RN , 2005 .

[266]  Irit Dinur,et al.  The PCP theorem by gap amplification , 2006, STOC.

[267]  Michael Langberg,et al.  The RPR2 rounding technique for semidefinite programs , 2006, J. Algorithms.

[268]  S. Chatterjee.  A generalization of the Lindeberg principle , 2005, math/0508519.

[269]  Raphael Rossignol.  Threshold for monotone symmetric properties through a logarithmic Sobolev inequality , 2005, math/0511607.

[270]  Ryan O'Donnell,et al.  Learning monotone decision trees in polynomial time , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[271]  Ryan O'Donnell,et al.  SDP gaps and UGC-hardness for MAXCUTGAIN , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[272]  Andris Ambainis.  Polynomial degree vs. quantum query complexity , 2006, J. Comput. Syst. Sci..

[273]  Ryan O'Donnell,et al.  On the Fourier tails of bounded functions over the discrete cube , 2006, STOC '06.

[274]  Per Austrin,et al.  Balanced max 2-sat might not be the hardest , 2007, STOC '07.

[275]  Elchanan Mossel.  Gaussian Bounds for Noise Correlation of Functions , 2007, FOCS 2007.

[276]  P. Wolff,et al.  Hypercontractivity of simple random variables , 2007 .

[277]  Martin Grohe.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.

[278]  Dvir Falik,et al.  Edge-Isoperimetric Inequalities and Influences , 2007, Comb. Probab. Comput..

[279]  R. O'Donnell,et al.  On the Fourier tails of bounded functions over the discrete cube , 2007 .

[280]  David P. Williamson,et al.  Approximation Algorithm for MAX-CUT , 2007 .

[281]  Rocco A. Servedio,et al.  Testing Halfspaces , 2007, SIAM J. Comput..

[282]  D. Pallara,et al.  Short-time heat flow and functions of bounded variation in \mathbf{R}^N , 2007 .

[283]  Jeff Kahn,et al.  Thresholds and Expectation Thresholds , 2007, Comb. Probab. Comput..

[284]  Simon Litsyn,et al.  Breaking the ε-Soundness Bound of the Linearity Test over GF(2) , 2007, Electron. Colloquium Comput. Complex..

[285]  Per Austrin.  Towards Sharp Inapproximability For Any 2-CSP , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[286]  Prasad Raghavendra,et al.  Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.

[287]  Ryan O'Donnell,et al.  An optimal sdp algorithm for max-cut, and equally optimal long code tests , 2008, STOC.

[288]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[289]  Béla Bollobás,et al.  Random Graphs and Branching Processes , 2008 .

[290]  Ryan O'Donnell,et al.  Learning Geometric Concepts via Gaussian Surface Area , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[291]  Eli Ben-Sasson,et al.  Short PCPs with Polylog Query Complexity , 2008, SIAM J. Comput..

[292]  Per Austrin.  Conditional Inapproximability and Limited Independence , 2008 .

[293]  Adam Tauman Kalai,et al.  Agnostically learning decision trees , 2008, STOC.

[294]  T. Sanders,et al.  Boolean Functions with small Spectral Norm , 2006, math/0605524.

[295]  Andris Ambainis,et al.  The Need for Structure in Quantum Speedups , 2009, Theory Comput..

[296]  Shachar Lovett.  Unconditional Pseudorandom Generators for Low Degree Polynomials , 2009, Theory Comput..

[297]  P. Raghavendra,et al.  Approximating np-hard problems efficient algorithms and their limits , 2009 .

[298]  Nicolas de Condorcet.  Essai Sur L'Application de L'Analyse a la Probabilite Des Decisions Rendues a la Pluralite Des Voix , 2009 .

[299]  Rocco A. Servedio,et al.  Improved Approximation of Linear Threshold Functions , 2009, Computational Complexity Conference.

[300]  Shachar Lovett,et al.  Explicit lower bound for fooling polynomials by the sum of small-bias generators , 2009, Electron. Colloquium Comput. Complex..

[301]  Ryan O'Donnell,et al.  Testing Fourier Dimensionality and Sparsity , 2009, ICALP.

[302]  Emanuele Viola,et al.  Guest Column: correlation bounds for polynomials over {0 1} , 2009, SIGA.

[303]  C. Hermite.  Œuvres de Charles Hermite: Sur un nouveau développement en série des fonctions , 2009 .

[304]  Emanuele Viola.  Correlation bounds for polynomials over { 0 , 1 , 2009 .

[305]  Amnon Ta-Shma,et al.  Constructing Small-Bias Sets from Algebraic-Geometric Codes , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[306]  Ryan O'Donnell,et al.  3-bit Dictator Testing: 1 vs. 5/8 , 2009, SODA.

[307]  Fred S. Roberts,et al.  The Mathematics of Preference, Choice and Order , 2009, Studies in Choice and Welfare.

[308]  L. Ambrosio,et al.  BV functions in abstract Wiener spaces , 2010 .

[309]  Sanjeev Arora,et al.  Subexponential Algorithms for Unique Games and Related Problems , 2010, FOCS.

[310]  Hamed Hatami.  A structure theorem for Boolean functions with small total influences , 2010, 1008.1021.

[311]  S. Kwapień.  On Hoeffding decomposition in $L_{p}$ , 2010 .

[312]  Simon Litsyn,et al.  Breaking the Epsilon-Soundness Bound of the Linearity Test over GF(2) , 2008, SIAM J. Comput..

[313]  Prasad Raghavendra,et al.  Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions , 2009, SIAM J. Comput..

[314]  L. Ambrosio,et al.  Surface measures and convergence of the Ornstein-Uhlenbeck semigroup in Wiener spaces , 2010, 1009.0189.

[315]  Claude Carlet,et al.  Boolean Functions for Cryptography and Error-Correcting Codes , 2010, Boolean Models and Methods.

[316]  Ryan O'Donnell,et al.  Polynomial regression under arbitrary product distributions , 2010, Machine Learning.

[317]  M. Hino.  Sets of finite perimeter and the Hausdorff-Gauss measure on the Wiener space , 2009, 0907.0056.

[318]  Subhash Khot.  On the Unique Games Conjecture (Invited Survey) , 2010, Computational Complexity Conference.

[319]  Homin K. Lee,et al.  Decision Trees and Influence: an Inductive Proof of the OSSS Inequality , 2010, Theory Comput..

[320]  Emanuele Viola,et al.  Pseudorandom Bits for Polynomials , 2010, SIAM J. Comput..

[321]  P. Gopalan,et al.  Fooling Functions of Halfspaces under Product Distributions , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

[322]  Frédéric Magniez,et al.  Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority , 2011, ICALP.

[323]  Rahul Jain,et al.  The Influence Lower Bound Via Query Elimination , 2011, Theory Comput..

[324]  Subhash Khot.  Inapproximability of NP-complete Problems, Discrete Fourier Analysis, and Geometry , 2011 .

[325]  Gretchen L. Matthews,et al.  Small-bias sets from extended norm-trace codes , 2011 .

[326]  Russell Impagliazzo,et al.  A satisfiability algorithm for AC0 , 2011, SODA.

[327]  Elchanan Mossel,et al.  On Reverse Hypercontractivity , 2011, Geometric and Functional Analysis.

[328]  Kazuyuki Amano,et al.  Tight Bounds on the Average Sensitivity of k-CNF , 2011, Theory Comput..

[329]  D. Kane.  On Elliptic Curves, the ABC Conjecture, and Polynomial Threshold Functions A dissertation presented , 2011 .

[330]  Yuan Zhou,et al.  Hypercontractivity, sum-of-squares proofs, and their applications , 2012, STOC '12.

[331]  Nikos Leonardos.  An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, , 2013, ICALP.

[332]  Georges-Théodule Guilbaud.  Les théories de l'intérêt général et le problème logique de l'agrégation , 2012 .

[333]  Ryan O'Donnell,et al.  A new point of NP-hardness for unique games , 2012, STOC '12.

[334]  Virginia Vassilevska Williams,et al.  Multiplying matrices faster than coppersmith-winograd , 2012, STOC '12.

[335]  Yuan Zhou,et al.  Hypercontractive inequalities via SOS, with an application to Vertex-Cover , 2012, ArXiv.

[336]  Johan Håstad,et al.  On the Correlation of Parity and Small-Depth Circuits , 2014, SIAM J. Comput..

[337]  Russell Impagliazzo,et al.  A satisfiability algorithm for AC0 , 2012, ACM-SIAM Symposium on Discrete Algorithms.

[338]  Elchanan Mossel,et al.  Robust Optimality of Gaussian Noise Stability , 2012, 1210.4126.

[339]  Gregory Valiant,et al.  Finding Correlations in Subquadratic Time, with Applications to Learning Parities and Juntas , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[340]  Omer Reingold,et al.  DNF Sparsification and a Faster Deterministic Counting Algorithm , 2012, Computational Complexity Conference.

[341]  M. Novaga,et al.  An introduction to $BV$ functions in Wiener spaces , 2012, 1212.5926.

[342]  Ryan O'Donnell,et al.  Gaussian noise sensitivity and Fourier tails , 2012, 2012 IEEE 27th Conference on Computational Complexity.

[343]  Deepak Bal.  On Sharp Thresholds of Monotone Properties: Bourgain's Proof Revisited. , 2013, 1302.1162.

[344]  L. Ambrosio,et al.  On sets of finite perimeter in Wiener spaces: Reduced boundary and convergence to halfspaces , 2012, 1206.6307.

[345]  R. O'Donnell,et al.  Sharpness of KKL on Schreier graphs , 2013 .

[346]  Elchanan Mossel,et al.  Majority is stablest: discrete and SoS , 2012, STOC '13.

[347]  K. Ball,et al.  L 1 -SMOOTHING FOR THE ORNSTEIN–UHLENBECK SEMIGROUP. , 2013 .

[348]  Daniel M. Kane,et al.  The correct exponent for the Gotsman–Linial Conjecture , 2012, 2013 IEEE Conference on Computational Complexity.

[349]  François Le Gall,et al.  Powers of tensors and fast matrix multiplication , 2014, ISSAC.

[350]  Prahladh Harsha,et al.  Bounding the Sensitivity of Polynomial Threshold Functions , 2014, Theory Comput..

[351]  Jakub Onufry Wojtaszczyk,et al.  On some extensions of the FKN theorem , 2015, Theory Comput..

[352]  Ronen Eldan.  A two-sided estimate for the Gaussian noise stability deficit , 2013, 1307.2781.

[353]  Guy Kindler,et al.  Property Testing, PCP, andJuntas , 2002, Electron. Colloquium Comput. Complex..