Abstract
Bourgain showed that any noise stable Boolean function ff can be well-approximated by a junta. In this note we give an exponential sharpening of the parameters of Bourgain's result under the additional assumption that ff is a halfspace.
Original language | English |
---|---|
Article number | 4 |
Pages (from-to) | 1-13 |
Number of pages | 13 |
Journal | Chicago Journal of Theoretical Computer Science |
Volume | 2015 |
DOIs | |
Publication status | Published - 19 Oct 2015 |