Published in: Dagstuhl Seminar Proceedings, Volume 6111, Complexity of Boolean Functions (2006)
Frank J. Balbach and Thomas Zeugmann. On the Teachability of Randomized Learners. In Complexity of Boolean Functions. Dagstuhl Seminar Proceedings, Volume 6111, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{balbach_et_al:DagSemProc.06111.13, author = {Balbach, Frank J. and Zeugmann, Thomas}, title = {{On the Teachability of Randomized Learners}}, booktitle = {Complexity of Boolean Functions}, pages = {1--20}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6111}, editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.13}, URN = {urn:nbn:de:0030-drops-6203}, doi = {10.4230/DagSemProc.06111.13}, annote = {Keywords: Algorithmic Teaching, Complexity of teaching} }
Feedback for Dagstuhl Publishing