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

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.