Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries

Shevchenko and Zolotykh. "Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries." International Conference on Algorithmic Learning Theory, 1998. doi:10.1007/3-540-49730-7_5

[Shevchenko and Zolotykh. "Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries." International Conference on Algorithmic Learning Theory, 1998.](https://mlanthology.org/alt/1998/shevchenko1998alt-lower/) doi:10.1007/3-540-49730-7_5

@inproceedings{shevchenko1998alt-lower,
  title     = {{Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries}},
  author    = {Shevchenko, Valery N. and Zolotykh, Nikolai Yu.},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {1998},
  pages     = {61-71},
  doi       = {10.1007/3-540-49730-7_5},
  url       = {https://mlanthology.org/alt/1998/shevchenko1998alt-lower/}
}