{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:52:37Z","timestamp":1752231157151,"version":"3.32.0"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Complexity"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf01205054","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T14:32:28Z","timestamp":1109255548000},"page":"37-61","source":"Crossref","is-referenced-by-count":11,"title":["An algorithm to learn read-once threshold formulas, and transformations between learning models"],"prefix":"10.1007","volume":"4","author":[{"given":"Nader H.","family":"Bshouty","sequence":"first","affiliation":[]},{"given":"Thomas R.","family":"Hancock","sequence":"additional","affiliation":[]},{"given":"Lisa","family":"Hellerstein","sequence":"additional","affiliation":[]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1987","unstructured":"D. Angluin, Queries and concept learning.Machine Learning 2 (1987), 319?342.","journal-title":"Machine Learning"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/138027.138061","volume":"40","author":"D. Angluin","year":"1993","unstructured":"D. Angluin, L. Hellerstein, andM. Karpinski, Learning read-once formulas with queries.J. Assoc. Comput. Mach. 40 (1993), 185?210.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"N. H. Bshouty, T. R. Hancock, and L. Hellerstein, Learning boolean read-once formulas with arbitrary symmetric and constant fan-in gates.Proc. 5th Ann. Workshop Comput. Learning Theory (1992a), 1?15.","DOI":"10.1145\/130385.130386"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"N. H. Bshouty, T. R. Hancock, and L. Hellerstein, Learning arithmetic read-once formulas.Proc. Twenty-fourth Ann. ACM Symp. Theor. Comput. (1992b), 350?381.","DOI":"10.1145\/129712.129747"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"N. H. Bshouty, S. A. Goldman, T. R. Hancock, and S. Matar, Asking questions to minimize errors.Proc. 6th Ann. Conf. Comput. Learning Theory (1993), 41?50.","DOI":"10.1145\/168304.168310"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"S. A. Goldman, M. J. Kearns, and R. E. Schapire, Exact identification of circuits using fixed points of amplification functions.Proc. 31st Ann. Symp. Found. Comput. Sci. (1990), 193?202. To appear, SIAM J. Comput.","DOI":"10.1016\/B978-1-55860-146-8.50034-5"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"R. Heiman, Newman I., and A. Wigderson, On read once threshold formulas and their randomized decision tree complexity.Proc. 5th Ann. IEEE Symp. Struct. Complex. Theory (1990), 78?87.","DOI":"10.1109\/SCT.1990.113956"}],"container-title":["Computational Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01205054.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01205054\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01205054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T18:40:35Z","timestamp":1734979235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01205054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF01205054"],"URL":"https:\/\/doi.org\/10.1007\/bf01205054","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"type":"print","value":"1016-3328"},{"type":"electronic","value":"1420-8954"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}