Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions

Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson. Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions. In Madhu Sudan, editor, Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, Cambridge, MA, USA, January 14-16, 2016. pages 59-70, ACM, 2016. [doi]

@inproceedings{GopalanNSTW16,
  title = {Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions},
  author = {Parikshit Gopalan and Noam Nisan and Rocco A. Servedio and Kunal Talwar and Avi Wigderson},
  year = {2016},
  doi = {10.1145/2840728.2840738},
  url = {http://doi.acm.org/10.1145/2840728.2840738},
  researchr = {https://researchr.org/publication/GopalanNSTW16},
  cites = {0},
  citedby = {0},
  pages = {59-70},
  booktitle = {Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, Cambridge, MA, USA, January 14-16, 2016},
  editor = {Madhu Sudan},
  publisher = {ACM},
  isbn = {978-1-4503-4057-1},
}