{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T00:49:05Z","timestamp":1672966145894},"reference-count":20,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0020-0190(01)00137-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:08:51Z","timestamp":1027616931000},"page":"267-272","source":"Crossref","is-referenced-by-count":3,"title":["On the limits of efficient teachability"],"prefix":"10.1016","volume":"79","author":[{"given":"Rocco A.","family":"Servedio","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0020-0190(01)00137-5_BIB001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(94)00007-Z","article-title":"On specifying boolean functions using labelled examples","volume":"61","author":"Anthony","year":"1995","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/S0020-0190(01)00137-5_BIB002","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0885-064X(90)90012-3","article-title":"On learning a union of halfspaces","volume":"6","author":"Baum","year":"1990","journal-title":"J. Complexity"},{"key":"10.1016\/S0020-0190(01)00137-5_BIB003","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/72.80287","article-title":"Polynomial time algorithms for learning neural nets","volume":"2","author":"Baum","year":"1991","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/S0020-0190(01)00137-5_BIB004","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1006\/jcss.1997.1559","article-title":"Learning with unreliable boundary queries","volume":"56","author":"Blum","year":"1998","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(01)00137-5_BIB005","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1006\/jcss.1997.1475","article-title":"Learning an intersection of a constant number of halfspaces over a uniform distribution","volume":"54","author":"Blum","year":"1997","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(01)00137-5_BIB006","series-title":"Advances in Neural Information Processing Systems, I","first-page":"494","article-title":"Training a 3-node neural net is NP-complete","author":"Blum","year":"1989"},{"key":"10.1016\/S0020-0190(01)00137-5_BIB007","series-title":"Proc. 1988 ACM Workshop on Computational Learning Theory","first-page":"251","article-title":"Inductive inference \u2014 An abstract approach","author":"Cherniavsky","year":"1988"},{"key":"10.1016\/S0020-0190(01)00137-5_BIB008","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1006\/jcss.1995.1003","article-title":"On the complexity of teaching","volume":"50","author":"Goldman","year":"1995","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(01)00137-5_BIB009","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1006\/jcss.1996.0020","article-title":"Teaching a smarter learner","volume":"52","author":"Goldman","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(01)00137-5_BIB010","series-title":"Proc. 8th Conf. on Computational Learning Theory","first-page":"108","article-title":"Generalized teaching dimensions and the query complexity of learning","author":"Hegedus","year":"1995"},{"issue":"5","key":"10.1016\/S0020-0190(01)00137-5_BIB011","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1145\/234752.234755","article-title":"How many queries are needed to learn?","volume":"43","author":"Hellerstein","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00137-5_BIB012","unstructured":"J. Jackson, Personal communication, 2000"},{"key":"10.1016\/S0020-0190(01)00137-5_BIB013","series-title":"Proc. 5th Annual Workshop on Computational Learning Theory","first-page":"319","article-title":"A computational model of teaching","author":"Jackson","year":"1992"},{"key":"10.1016\/S0020-0190(01)00137-5_BIB014","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/PL00013834","article-title":"PAC learning intersections of halfspaces with membership queries","volume":"22","author":"Kwek","year":"1998","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(01)00137-5_BIB015","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF00993976","article-title":"Algorithms and lower bounds for on-line learning of geometrical concepts","volume":"14","author":"Maass","year":"1994","journal-title":"Machine Learning"},{"key":"10.1016\/S0020-0190(01)00137-5_BIB016","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1006\/jcss.1997.1491","article-title":"A model of interactive teaching","volume":"54","author":"Mathias","year":"1997","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(01)00137-5_BIB017","series-title":"Proc. 12th Internat. Joint Conf. on Artificial Intel.","first-page":"705","article-title":"Learning with a helpful teacher","author":"Salzberg","year":"1991"},{"key":"10.1016\/S0020-0190(01)00137-5_BIB018","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF03037091","article-title":"Teachability in computational learning","volume":"8","author":"Shinohara","year":"1991","journal-title":"New Generation Computing"},{"key":"10.1016\/S0020-0190(01)00137-5_BIB019","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0196-6774(84)90016-6","article-title":"Short monotone formulae for the majority function","volume":"5","author":"Valiant","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(01)00137-5_BIB020","series-title":"Proc. 38th Annual Symp. on Foundations of Computer Science","first-page":"508","article-title":"A random sampling based algorithm for learning the intersection of halfspaces","author":"Vempala","year":"1997"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001375?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001375?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T13:26:41Z","timestamp":1555766801000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001001375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0020019001001375"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00137-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}