{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:47:19Z","timestamp":1752230839087},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609223"},{"type":"electronic","value":"9783540497233"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60922-9_20","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:04:10Z","timestamp":1330290250000},"page":"231-242","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["PAC learning with simple examples"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Denis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyrille","family":"D'Halluin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9mi","family":"Gilleron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D. Angluin","year":"1982","unstructured":"D. Angluin, Inference of reversible languages, J. Assoc. Comput. Mach.\n29 (1982) 741\u2013765.","journal-title":"J. Assoc. Comput. Mach."},{"key":"20_CR2","first-page":"741","volume":"2","author":"D. Angluin","year":"1982","unstructured":"D. Angluin, Queries and Concept Learning, Machine Learning\n2 (1982) 741\u2013765.","journal-title":"Machine Learning"},{"key":"20_CR3","unstructured":"G.Benedek and A.Itai, Learnability by fixed ditribution, Proc. 1st ACM Workshop on Computational Learning Theory, (1988) 80\u201390."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, S. Rudich, Weakly Learning DNF and Characterizing Statistical Query Learning Using Fourier Analysis, Proc. th 26th ACM Symposium on Theory of Computing, (1994) 253\u2013262.","DOI":"10.1145\/195058.195147"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A. Blumer","year":"1987","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, and M.K. Warmuth, Occam's razor, Inform. Proc. Lett.\n24 (1987) 377\u2013380.","journal-title":"Inform. Proc. Lett."},{"key":"20_CR6","unstructured":"J. Castro, A note on learning decision lists, Report de Recerca, LSI-95-2-R, Dept LSI, UPC, (1995)."},{"key":"20_CR7","unstructured":"D.Haussler, M.Kearns, N.Littlestone and M.Warmuth, Equivalence of models for polynomial learnability, Proc. 1st ACM Workshop on Computational Learning Theory, (1988) 42\u201355."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"M.Kearns, M.Li, L.Pitt and L.G.Valiant, On the learnability of boolean formulae, Proc. 19th ACM Symposium on Theory of Computing, (1987) 285\u2013295.","DOI":"10.1145\/28395.28426"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1137\/0220056","volume":"20","author":"M. Li","year":"1991","unstructured":"M. Li and P. Vit\u00e1nyi, Learning simple concepts under simple distributions, SIAM J. Comput.\n20 (1991) 911\u2013935.","journal-title":"SIAM J. Comput."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"M.Li and P.Vit\u00e1nyi, An introduction to Kolmogorov complexity and its applications, Texts and Monographs in Computer Science, Springer Verlag, (1993).","DOI":"10.1007\/978-1-4757-3860-5"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"B.K.Natarajan, On learning boolean functions, Proc. 19th ACM Symposium on Theory of Computing, (1987) 296\u2013304.","DOI":"10.1145\/28395.28427"},{"key":"20_CR12","unstructured":"B.K.Natarajan, Machine Learning: a theoretical approach, Morgan Kaufman, (1991)."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"L.G.Valiant, A theory of the learnable, Comm. ACM., (1984) 1134\u20131142.","DOI":"10.1145\/1968.1972"}],"container-title":["Lecture Notes in Computer Science","STACS 96"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60922-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:47:57Z","timestamp":1558270077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60922-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609223","9783540497233"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-60922-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}