{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:09Z","timestamp":1725664989249},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626855"},{"type":"electronic","value":"9783540684312"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62685-9_3","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:48:05Z","timestamp":1330296485000},"page":"16-26","source":"Crossref","is-referenced-by-count":2,"title":["Learning monotone term decision lists"],"prefix":"10.1007","author":[{"given":"David","family":"Guijarro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00edctor","family":"Lav\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay","family":"Raghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"3_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin. \u201cQueries and Concept Learning\u201d. Machine Learning 2, 319\u2013342, 1988.","journal-title":"Machine Learning"},{"key":"3_CR2","first-page":"121","volume":"5","author":"D. Angluin","year":"1990","unstructured":"D. Angluin. \u201cNegative Results for Equivalence Queries\u201d. Machine Learning, vol. 5, 121\u2013150, 1990.","journal-title":"Machine Learning"},{"key":"3_CR3","unstructured":"M. Anthony and N. Biggs. \u201cComputational Learning Theory: An Introduction\u201d. Cambridge University Press, 1992."},{"issue":"number1","key":"3_CR4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/138027.138061","volume":"40","author":"D. Angluin","year":"1993","unstructured":"D. Angluin, L. Hellerstein, and M. Karpinski. \u201cLearning Read-Once Formulas with Queries\u201d. Journal of the ACM, vol. 40, number 1, 185\u2013210, 1993.","journal-title":"Journal of the ACM"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"N. Bshouty. \u201cSimple Learning Algorithms Using Divide and Conquer\u201d. Proceedings of the Eighth Annual Workshop on Computational Learning Theory, 447\u2013453, 1995.","DOI":"10.1145\/225298.225352"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"S. Goldman and M. Kearns. \u201cOn the Complexity of Teaching\u201d. Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 303\u2013314, 1991.","DOI":"10.1016\/B978-1-55860-213-7.50031-6"},{"issue":"No.5","key":"3_CR7","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1145\/234752.234755","volume":"43","author":"L. Hellerstein","year":"1996","unstructured":"L. Hellerstein, K. Pillaipakkamnatt, V. Raghavan, D. Wilkins. \u201cHow Many Queries are Needed to Learn?\u201d Journal of the ACM, Vol. 43, No. 5, September 1996, pp. 840\u2013862.","journal-title":"Journal of the ACM"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz. \u201cA Simple Algorithm for Learning O(log n)-Term DNF\u201d. Proceedings of the Ninth Annual Workshop on Computational Learning Theory, 266\u2013269, 1996.","DOI":"10.1145\/238061.238115"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1137\/0220056","volume":"20","author":"M. Li","year":"1991","unstructured":"M. Li and P. Vit\u00e1nyi. \u201cLearning Simple Concepts under Simple Distributions\u201d. SIAM Journal of Computing 20, 911\u2013935, 1991.","journal-title":"SIAM Journal of Computing"},{"key":"3_CR10","first-page":"229","volume":"2","author":"R. Rivest","year":"1987","unstructured":"R. Rivest. \u201cLearning Decision Lists\u201d. Machine Learning 2, 229\u2013246, 1987.","journal-title":"Machine Learning"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"H. U. Simon. \u201cLearning Decision Lists and Trees with Equivalence Queries\u201d. Proceeding of the 2nd European Conference EUROCOLT, pp 322\u2013336, 1995.","DOI":"10.1007\/3-540-59119-2_188"},{"issue":"11","key":"3_CR12","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. Valiant","year":"1984","unstructured":"L. Valiant. \u201cA Theory of the Learnable\u201d. Communications of the ACM 27:11, 1134\u20131142, 1984.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62685-9_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:39:31Z","timestamp":1619573971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62685-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626855","9783540684312"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-62685-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}