Pages that link to "Item:Q2379368"

The following pages link to Gaussian bounds for noise correlation of functions (Q2379368):

Displaying 30 items.

• Noise-stability and central limit theorems for effective resistance of random electric networks (Q282503) (← links)
• The correct exponent for the Gotsman-Linial conjecture (Q488047) (← links)
• Noise stability and correlation with half spaces (Q1748919) (← links)
• Maximally stable Gaussian partitions with discrete applications (Q1760364) (← links)
• A quantitative Arrow theorem (Q1930856) (← links)
• Noise correlation bounds for uniform low degree functions (Q1944763) (← links)
• Invariance principles for homogeneous sums: universality of Gaussian Wiener chaos (Q1958464) (← links)
• On arithmetic progressions in symmetric sets in finite field model (Q2200438) (← links)
• The probability of intransitivity in dice and close elections (Q2210747) (← links)
• Gaussian bounds for noise correlation of resilient functions (Q2303682) (← links)
• (Q2816412) (← links)
• Multidimensional limit theorems for homogeneous sums: A survey and a general transfer principle (Q2954236) (← links)
• A query efficient non-adaptive long code test with perfect completeness (Q3192387) (← links)
• Approximating CSPs Using LP Relaxation (Q3448840) (← links)
• Global and fixed-terminal cuts in digraphs (Q5002602) (← links)
• The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
• Probabilistic view of voting, paradoxes, and manipulation (Q5081545) (← links)
• Simultaneous max-cut is harder to approximate than max-cut (Q5092456) (← links)
• Nonlocal Games with Noisy Maximally Entangled States are Decidable (Q5096445) (← links)
• Dimension Reduction for Polynomials over Gaussian Space and Applications (Q5121916) (← links)
• Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems (Q5126774) (← links)
• An Improved Dictatorship Test with Perfect Completeness (Q5136305) (← links)
• Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
• Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
• $(2+\varepsilon)$-Sat Is NP-hard (Q5363382) (← links)
• A Characterization of hard-to-cover CSPs (Q5857608) (← links)
• Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
• Hypercontractivity for global functions and sharp thresholds (Q6053547) (← links)
• A sprinkled decoupling inequality for Gaussian processes and applications (Q6137374) (← links)
• Forbidden intersections for codes (Q6139795) (← links)