{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:42:48Z","timestamp":1752230568754},"reference-count":28,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7837,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1992,2]]},"DOI":"10.1016\/0890-5401(92)90047-j","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"179-202","source":"Crossref","is-referenced-by-count":11,"title":["Learning in parallel"],"prefix":"10.1016","volume":"96","author":[{"given":"Jeffrey Scott","family":"Vitter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jyh-Han","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(92)90047-J_BIB1","series-title":"Proceedings of the 16th Annual ACM Symposium on Theory of Computing","first-page":"471","article-title":"A theorem on probabilistic constant depth computations","author":"Ajtai","year":"1984"},{"issue":"4","key":"10.1016\/0890-5401(92)90047-J_BIB2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF00116829","article-title":"Learning from noisy examples","volume":"2","author":"Angluin","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/0890-5401(92)90047-J_BIB3","series-title":"Proceedings of the 30th Annual Symposium on Foundations of Computer Science","first-page":"54","article-title":"Efficient NC algorithms for set cover with application to learning and geometry","author":"Berger","year":"1989"},{"key":"10.1016\/0890-5401(92)90047-J_BIB4","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","article-title":"Occam's razor","volume":"24","author":"Blumer","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(92)90047-J_BIB5","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik-Chervonenkis dimension","volume":"36","author":"Blumer","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"issue":"2","key":"10.1016\/0890-5401(92)90047-J_BIB6","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","article-title":"Constant depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0890-5401(92)90047-J_BIB7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","article-title":"A greedy heuristic for the set-covering problem","volume":"4","author":"Chv\u00e1tal","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0890-5401(92)90047-J_BIB8","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. Control"},{"key":"10.1016\/0890-5401(92)90047-J_BIB9","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0020-0190(79)90152-2","article-title":"Linear programming is log-space hard for P","volume":"8","author":"Dobkin","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(92)90047-J_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(80)90031-6","article-title":"The complexity of linear programming","volume":"11","author":"Dobkin","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(92)90047-J_BIB11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits, and the polynomial-time hierarchy","volume":"17","author":"Furst","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0890-5401(92)90047-J_BIB12","series-title":"Proceedings of the 1st ACM Workshop on Computational Learning Theory","article-title":"Equivalence of models for polynomial learnability","author":"Haussler","year":"1988"},{"key":"10.1016\/0890-5401(92)90047-J_BIB13","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(92)90047-J_BIB14","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/0890-5401(92)90047-J_BIB15","series-title":"Handbook of Theoretical Computer Science","article-title":"Parallel algorithms for shared-memory machines","author":"Karp","year":"1989"},{"key":"10.1016\/0890-5401(92)90047-J_BIB16","series-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing","first-page":"267","article-title":"Learning in the presence of malicious errors","author":"Kearns","year":"1988"},{"key":"10.1016\/0890-5401(92)90047-J_BIB17","series-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing","first-page":"285","article-title":"On the learnability of boolean formulae","author":"Kearns","year":"1987"},{"key":"10.1016\/0890-5401(92)90047-J_BIB18","first-page":"191","article-title":"A polynomial algorithm in linear programming","volume":"20","author":"Khachiyan","year":"1979","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0890-5401(92)90047-J_BIB19","author":"Laird","year":"1988"},{"key":"10.1016\/0890-5401(92)90047-J_BIB20","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0890-5401(92)90047-J_BIB21","author":"Preparata","year":"1985"},{"key":"10.1016\/0890-5401(92)90047-J_BIB22","author":"Pitt","year":"1986"},{"key":"10.1016\/0890-5401(92)90047-J_BIB23","series-title":"Proceedings of the 1 st ACM Workshop on Computational Learning Theory","article-title":"Learning k-DNF with noise in the attributes","author":"Shackelford","year":"1988"},{"key":"10.1016\/0890-5401(92)90047-J_BIB24","series-title":"Proceedings of the 1 st ACM Workshop on Computational Learning Theory","article-title":"Types of noise in data for concept learning","author":"Sloan","year":"1988"},{"issue":"2","key":"10.1016\/0890-5401(92)90047-J_BIB25","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0213027","article-title":"Simulation of parallel random access machine by circuits","volume":"13","author":"Stockmeyer","year":"1984","journal-title":"SIAM J. Comput."},{"issue":"11","key":"10.1016\/0890-5401(92)90047-J_BIB26","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"},{"key":"10.1016\/0890-5401(92)90047-J_BIB27","series-title":"Proceedings of the 9th IJCAI","first-page":"560","article-title":"Learning disjunctions of conjunctions","author":"Valiant","year":"1985"},{"key":"10.1016\/0890-5401(92)90047-J_BIB28","author":"Vitter","year":"1988"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019290047J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019290047J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:25:30Z","timestamp":1548897930000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019290047J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["089054019290047J"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(92)90047-j","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}