A Lower Bound for Agnostically Learning Disjunctions

Klivans and Sherstov. "A Lower Bound for Agnostically Learning Disjunctions." Annual Conference on Computational Learning Theory, 2007. doi:10.1007/978-3-540-72927-3_30

[Klivans and Sherstov. "A Lower Bound for Agnostically Learning Disjunctions." Annual Conference on Computational Learning Theory, 2007.](https://mlanthology.org/colt/2007/klivans2007colt-lower/) doi:10.1007/978-3-540-72927-3_30

@inproceedings{klivans2007colt-lower,
  title     = {{A Lower Bound for Agnostically Learning Disjunctions}},
  author    = {Klivans, Adam R. and Sherstov, Alexander A.},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2007},
  pages     = {409-423},
  doi       = {10.1007/978-3-540-72927-3_30},
  url       = {https://mlanthology.org/colt/2007/klivans2007colt-lower/}
}