{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:04:30Z","timestamp":1750694670516},"reference-count":17,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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":[[1997,3]]},"DOI":"10.1016\/s0020-0190(97)00026-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:36:00Z","timestamp":1051115760000},"page":"289-292","source":"Crossref","is-referenced-by-count":19,"title":["A simple algorithm for learning O(log n)-term DNF"],"prefix":"10.1016","volume":"61","author":[{"given":"Eyal","family":"Kushilevitz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00026-4_BIB1","series-title":"Proc. 32th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"170","article-title":"Exact learning of read-twice DNF formulas","author":"Aizenstein","year":"1991"},{"key":"10.1016\/S0020-0190(97)00026-4_BIB2","series-title":"Proc. 5th Ann. ACM Workshop on Computational Learning Theory","first-page":"71","article-title":"Exact learning of read-k disjoint DNF and not-so-disjoint DNF","author":"Aizenstein","year":"1992"},{"key":"10.1016\/S0020-0190(97)00026-4_BIB3","article-title":"Learning k-term DNF formulas using queries and counterexamples","author":"Angluin","year":"1987"},{"key":"10.1016\/S0020-0190(97)00026-4_BIB4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","article-title":"Learning regular sets from queries and counterexamples","volume":"75","author":"Angluin","year":"1987","journal-title":"Inform. and Comput."},{"issue":"4","key":"10.1016\/S0020-0190(97)00026-4_BIB5","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)00026-4_BIB6","series-title":"Proc. of 28th Ann. Symp. on the Theory of Computing","first-page":"126","article-title":"Learning Sat-k-DNF formulas from membership queries","author":"Bergadano","year":"1996"},{"key":"10.1016\/S0020-0190(97)00026-4_BIB7","doi-asserted-by":"crossref","unstructured":"F. Bergadano and S. Varricchio, Learning behaviors of automata from multiplicity and equivalence queries, in: Proc. 2nd Italian Conf. on Algorithms and Complexity, Lecture Notes in Computer Science, Vol. 778 (Springer, Berlin) 54\u201362; also in: SIAM J. Comput., to appear.","DOI":"10.1007\/3-540-57811-0_6"},{"key":"10.1016\/S0020-0190(97)00026-4_BIB8","series-title":"Proc. 7th Ann. ACM Workshop on Computational Learning Theory","first-page":"110","article-title":"On learning read-k-satisfy-j DNF","author":"Blum","year":"1994"},{"key":"10.1016\/S0020-0190(97)00026-4_BIB9","series-title":"Proc. 37th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"349","article-title":"On the applications of multiplicity automata in learning","author":"Beimel","year":"1996"},{"key":"10.1016\/S0020-0190(97)00026-4_BIB10","series-title":"Proc. 24th ACM Symp. on Theory of Computing","first-page":"382","article-title":"Fast learning of k-term DNF formulas with queries","author":"Blum","year":"1992"},{"key":"10.1016\/S0020-0190(97)00026-4_BIB11","series-title":"Proc. 34th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"302","article-title":"Exact learning via the monotone theory","author":"Bshouty","year":"1993"},{"key":"10.1016\/S0020-0190(97)00026-4_BIB12","series-title":"Proc. 8th Ann. ACM Workshop on Computational Learning Theory","first-page":"447","article-title":"Simple learning algorithms using divide and conquer","author":"Bshouty","year":"1995"},{"key":"10.1016\/S0020-0190(97)00026-4_BIB13","series-title":"Proc. 4th Ann. Workshop on Computational Learning Theory","first-page":"199","article-title":"Learning 2\u03bc DNF formulas and k\u03bc decision trees","author":"Hancock","year":"1991"},{"key":"10.1016\/S0020-0190(97)00026-4_BIB14","series-title":"An Introduction to Computational Learning Theory","author":"Kearns","year":"1994"},{"key":"10.1016\/S0020-0190(97)00026-4_BIB15","series-title":"Proc. 34th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"182","article-title":"Splitters and near-optimal derandomization","author":"Naor","year":"1995"},{"key":"10.1016\/S0020-0190(97)00026-4_BIB16","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1006\/inco.1993.1021","article-title":"Inference of finite automata using homing sequences","volume":"103","author":"Rivest","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(97)00026-4_BIB17","series-title":"Proc. 6th Ann. ACM Workshop on Computational Learning Theory","first-page":"17","article-title":"Learning sparse multivariate polynomials over a field with queries and counterexamples","author":"Schapire","year":"1993"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000264?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000264?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:20Z","timestamp":1556348240000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097000264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0020019097000264"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00026-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}