Valery N. Shevchenko, Nikolai Yu. Zolotykh. Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries. In Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann, editors, Algorithmic Learning Theory, 9th International Conference, ALT 98, Otzenhausen, Germany, October 8-10, 1998, Proceedings. Volume 1501 of Lecture Notes in Computer Science, pages 61-71, Springer, 1998. [doi]
@inproceedings{ShevchenkoZ98,
title = {Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries},
author = {Valery N. Shevchenko and Nikolai Yu. Zolotykh},
year = {1998},
url = {http://link.springer.de/link/service/series/0558/bibs/1501/15010061.htm},
researchr = {https://researchr.org/publication/ShevchenkoZ98},
cites = {0},
citedby = {0},
pages = {61-71},
booktitle = {Algorithmic Learning Theory, 9th International Conference, ALT 98, Otzenhausen, Germany, October 8-10, 1998, Proceedings},
editor = {Michael M. Richter and Carl H. Smith and Rolf Wiehagen and Thomas Zeugmann},
volume = {1501},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-65013-X},
}