Jun-ichi Takeuchi. Some Improved Sample Complexity Bounds in the Probabilistic PAC Learning Model. In Shuji Doshita, Koichi Furukawa, Klaus P. Jantke, Toyoaki Nishida, editors, Algorithmic Learning Theory, Third Workshop, ALT 92, Tokyo, Japan, October 20-22, 1992, Proceedings. Volume 743 of Lecture Notes in Computer Science, pages 208-219, Springer, 1992.
@inproceedings{Takeuchi92,
title = {Some Improved Sample Complexity Bounds in the Probabilistic PAC Learning Model},
author = {Jun-ichi Takeuchi},
year = {1992},
researchr = {https://researchr.org/publication/Takeuchi92},
cites = {0},
citedby = {0},
pages = {208-219},
booktitle = {Algorithmic Learning Theory, Third Workshop, ALT 92, Tokyo, Japan, October 20-22, 1992, Proceedings},
editor = {Shuji Doshita and Koichi Furukawa and Klaus P. Jantke and Toyoaki Nishida},
volume = {743},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-57369-0},
}