The uniform hardcore lemma via approximate Bregman projections

@inproceedings{Barak2009TheUH,
  title={The uniform hardcore lemma via approximate Bregman projections},
  author={Boaz Barak and Moritz Hardt and Satyen Kale},
  booktitle={SODA},
  year={2009}
}
We give a simple, more efficient and uniform proof of the hard-core lemma, a fundamental result in complexity theory with applications in machine learning and cryptography. Our result follows from the connection between boosting algorithms and hard-core set constructions discovered by Klivans and Servedio [KS03]. Informally stated, our result is the following: suppose we fix a family of boolean functions. Assume there is an efficient algorithm which for every input length and every smooth… CONTINUE READING

Similar Papers

Loading similar papers…