Social choice, computational complexity, Gaussian geometry, and Boolean functions
From MaRDI portal
Publication:4589022
zbMath1375.91074arXiv1407.7763MaRDI QIDQ4589022
Publication date: 6 November 2017
Full work available at URL: https://arxiv.org/abs/1407.7763
computational complexityisoperimetrysocial choicemax-cuthypercontractivityanalysis of Boolean functionsmajority is stablestGaussian geometry
Gaussian processes (60G15) Social choice (91B14) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (2)
Phase transitions and noise sensitivity on the Poisson space via stopping sets and decision trees ⋮ Three candidate plurality is stablest for small correlations
This page was built for publication: Social choice, computational complexity, Gaussian geometry, and Boolean functions