Fetching the paper…
Reading the bibliography…
Gaussian bounds on noise correlation of functions play an important role in hardness of approximation, in quantitative social choice theory and in testing.
Geometric bounds on the Ornstein-Uhlenbeck velocity process
C. Borell · 1985
Earlier work this paper cites.
Some optimal inapproximability results
J. Håstad · 1997
Earlier work this paper cites.
A Fourier-theoretic perspective on the Concordet paradox and Arrow‘s theorem
G. Kalai · 2002
Earlier work this paper cites.
On the power of unique 2-prover 1-round games
S. Khot · 2002
Earlier work this paper cites.
Optimal inapproximability results for max-cut and other 2-variable csps?
S. Khot, G. Kindler, E. Mossel, and R. O‘Donnell · 2004
Earlier work this paper cites.
Noise stability of functions with low influences: invariance and optimality (extended abstract)
E. Mossel, R. O‘Donnell, and K. Oleszkiewicz · 2005
Earlier work this paper cites.
Optimal inapproximability results for max-cut and other 2-variable csps?
S. Khot, G. Kindler, E. Mossel, and R. O‘Donnell · 2007
Earlier work this paper cites.
Beating the random ordering is hard: Inapproximability of maximum acyclic subgraph
V. Guruswami, R. Manokaran, and P. Raghavendra · 2008
Earlier work this paper cites.
Gaussian bounds for noise correlation of functions and tight analysis of long codes
E. Mossel · 2008
Earlier work this paper cites.
Representations of general functions using smooth functions, 2008
E. Mossel and O. Schramm · 2008
Earlier work this paper cites.
Optimal Algorithms and Inapproximability Results For Every CSP?
P. Raghavendra · 2008
Earlier work this paper cites.
Testing juntas nearly optimally
E. Blais · 2009
Earlier work this paper cites.
Towards sharp inapproximability for any 2-csp
P. Austrin · 2010
Cited alongside, same era.
Inapproximability of hypergraph vertex cover and applications to scheduling problems
N. Bansal and S. Khot · 2010
Cited alongside, same era.
Bounded independence fools degree-2 threshold functions
I. Diakonikolas, D. M. Kane, and J. Nelson · 2010
Cited alongside, same era.
Gaussian bounds for noise correlation of functions
E. Mossel · 2010
Cited alongside, same era.
Noise stability of functions with low influences: invariance and optimality
E. Mossel, R. O‘Donnell, and K. Oleszkiewicz · 2010
Cited alongside, same era.
Invariance principles for homogeneous sums: universality of gaussian wiener chaos
I. Nourdin, G. Peccati, and G. Reinert · 2010
Cited alongside, same era.
Bypassing ugc from some optimal geometric inapproximability results
V. Guruswami, P. Raghavendra, R. Saket, and Y. Wu · 2012
Later among the works it cites.
New maximally stable gaussian partitions with discrete applications
M. Isaksson and E. Mossel · 2012
Later among the works it cites.
A quantitative arrow theorem
E. Mossel · 2012
Later among the works it cites.
Noise correlation bounds for uniform low degree functions
P. Austrin and E. Mossel · 2013
Later among the works it cites.
New algorithms and lower bounds for monotonicity testing
X. Chen, R. A. Servedio, and L.-Y. Tan · 2014
Later among the works it cites.
Real analysis in computer science: A collection of open problems, 2014
Y. Filmus, H. Hatami, S. Heilman, E. Mossel, R. O?Donnell, S. Sachdeva, A. Wan, and K. Wimmer · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A regularity lemma for low noisy-influences, 2010
R. O‘Donnell, R. Servedio, L.-Y. Tan, and A. Wan · 2010
Cited alongside, same era.
Randomly supported independence and resistance
P. Austrin and J. Håstad · 2011
Cited alongside, same era.
A quantitative version of the gibbard–satterthwaite theorem for three alternatives
E. Friedgut, G. Kalai, N. Keller, and N. Nisan · 2011
Cited alongside, same era.
Beating the random ordering is hard: Every ordering csp is approximation resistant
V. Guruswami, J. Håstad, R. Manokaran, P. Raghavendra, and M. Charikar · 2011
Cited alongside, same era.
On the usefulness of predicates
P. Austrin and J. Håstad · 2012
Cited alongside, same era.
Agnostic learning of monomials by halfspaces is hard
V. Feldman, V. Guruswami, P. Raghavendra, and Y. Wu · 2012
Cited alongside, same era.
Boolean function monotonicity testing requires (almost) n 1/2 non-adaptive queries
X. Chen, A. De, R. A. Servedio, and L.-Y. Tan · 2015
Later among the works it cites.
Approximation resistance from pairwise-independent subgroups
S. O. Chan · 2016
Later among the works it cites.
Lower Bounds on Same-Set Inner Product in Correlated Spaces
J. Hązła, T. Holenstein, and E. Mossel · 2016
Later among the works it cites.
A noisy-influence regularity lemma for boolean functions, 2016
C. Jones · 2016
Later among the works it cites.
Noise-stability and central limit theorems for effective resistance of random electric networks
R. Rossignol et al · 2016
Later among the works it cites.