The uniform hardcore lemma via approximate Bregman projections. Barak, B., Hardt, M., & Kale, S. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pages 1193–1200, 2009. SIAM.
The uniform hardcore lemma via approximate Bregman projections [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/soda/BarakHK09,
  author       = {Boaz Barak and
                  Moritz Hardt and
                  Satyen Kale},
  editor       = {Claire Mathieu},
  title        = {The uniform hardcore lemma via approximate Bregman projections},
  booktitle    = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
  pages        = {1193--1200},
  publisher    = {{SIAM}},
  year         = {2009},
  url          = {https://doi.org/10.1137/1.9781611973068.129},
  doi          = {10.1137/1.9781611973068.129},
  timestamp    = {Mon, 12 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/BarakHK09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0