Bourgain [Bou02] showed that any noise stable Boolean function f can be well-approximated by a junta. In this note we give an exponential sharpening of the parameters of Bourgainâ...
Ilias Diakonikolas, Ragesh Jaiswal, Rocco A. Serve...
: In a recent result, Khot and Saket [FOCS 2014] proved the quasi-NP-hardness of coloring a 2-colorable 12-uniform hypergraph with 2(logn)Ω(1) colors. This result was proved usin...
Abstract: Bourgain and Yehudayoff recently constructed O(1)-monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we cons...
Vida Dujmovic, Anastasios Sidiropoulos, David R. W...