{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:48:53Z","timestamp":1710258533337},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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":[[1998,2]]},"DOI":"10.1016\/s0020-0190(97)00204-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"217-222","source":"Crossref","is-referenced-by-count":9,"title":["On learning width two branching programs"],"prefix":"10.1016","volume":"65","author":[{"given":"Nader H.","family":"Bshouty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christino","family":"Tamon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David K.","family":"Wilson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00204-4_BIB1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/S0020-0190(97)00204-4_BIB2","series-title":"Proc. ACM Symp. on Theory of Computing","first-page":"444","article-title":"When won't membership queries help?","author":"Angluin","year":"1991"},{"key":"10.1016\/S0020-0190(97)00204-4_BIB3","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","article-title":"Bounded-width polynomial-size branching programs recognize exactly those languages in NC1","volume":"38","author":"Barrington","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(97)00204-4_BIB4","first-page":"377","article-title":"Occam's Razor","volume":"24","author":"Blumer","year":"1987"},{"key":"10.1016\/S0020-0190(97)00204-4_BIB5","first-page":"549","article-title":"Bounds for width two branching programs","volume":"15","author":"Borodin","year":"1986"},{"key":"10.1016\/S0020-0190(97)00204-4_BIB6","series-title":"Proc. 8th Ann. ACM Conf. on Computational Learning Theory","first-page":"361","article-title":"On learning bounded-width branching programs","author":"Erg\u00fcn","year":"1995"},{"key":"10.1016\/S0020-0190(97)00204-4_BIB7","series-title":"The Computational Complexity of Machine Learning","author":"Kearns","year":"1990"},{"key":"10.1016\/S0020-0190(97)00204-4_BIB8","series-title":"Proc. ACM Symp. on Theory of Computing","first-page":"433","article-title":"Cryptographic limitations on learning Boolean formulae and finite automata","author":"Kearns","year":"1989"},{"key":"10.1016\/S0020-0190(97)00204-4_BIB9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF00116827","article-title":"Learning quickly when irrelevant attributes abound, A new linear-threshold algorithm","volume":"2","author":"Littlestone","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/S0020-0190(97)00204-4_BIB10","series-title":"Proc. 6th Ann. Workshop on Computational Learning Theory","first-page":"27","article-title":"Learning \u03bc-branching programs with queries","author":"Raghavan","year":"1993"},{"key":"10.1016\/S0020-0190(97)00204-4_BIB11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF00058680","article-title":"Learning decision lists","volume":"2","author":"Rivest","year":"1987","journal-title":"Machine Learning"},{"issue":"11","key":"10.1016\/S0020-0190(97)00204-4_BIB12","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002044?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002044?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T06:57:27Z","timestamp":1556348247000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097002044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0020019097002044"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00204-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}