{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T04:06:31Z","timestamp":1768277191227,"version":"3.49.0"},"reference-count":65,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":8264,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0022-0000(90)90028-j","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"430-467","source":"Crossref","is-referenced-by-count":97,"title":["Prediction-preserving reducibility"],"prefix":"10.1016","volume":"41","author":[{"given":"Leonard","family":"Pitt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90028-J_BIB1","series-title":"Proceedings, 19th Annual IEEE Symposium on Foundations of Computer Science","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978"},{"key":"10.1016\/0022-0000(90)90028-J_BIB2","series-title":"Proceedings, 1989 Workshop on Computational Learning Theory","first-page":"134","article-title":"Equivalence queries and approximate fingerprints","author":"Angluin","year":"1989"},{"issue":"No. 2","key":"10.1016\/0022-0000(90)90028-J_BIB3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","article-title":"Leaning regular sets from queries and counter-examples","volume":"75","author":"Angluin","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0022-0000(90)90028-J_BIB4","article-title":"Learning Propositional Horn Sentences with Hints","author":"Angluin","year":"1987"},{"issue":"No 3","key":"10.1016\/0022-0000(90)90028-J_BIB5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0019-9958(78)90683-6","article-title":"On the complexity of minimum inference of regular sets","volume":"39","author":"Angluin","year":"1978","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(90)90028-J_BIB6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1987","journal-title":"Mach. Learning"},{"issue":"No. 3","key":"10.1016\/0022-0000(90)90028-J_BIB7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","article-title":"Inductive inference: Theory and methods","volume":"15","author":"Angluin","year":"1983","journal-title":"Comput. Surveys"},{"issue":"No. 3","key":"10.1016\/0022-0000(90)90028-J_BIB8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.5802\/aif.938","article-title":"Densite et dimension","volume":"33","author":"Assouad","year":"1983","journal-title":"Ann. Inst. Fourier (Grenoble)"},{"key":"10.1016\/0022-0000(90)90028-J_BIB9","first-page":"1224","article-title":"On the prediction of general recursive functions","volume":"13","author":"Barzdin","year":"1972","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0022-0000(90)90028-J_BIB10","article-title":"Polynomially Sized Boolean Circuits Are Not Learnable","author":"Beaver","year":"1987"},{"key":"10.1016\/0022-0000(90)90028-J_BIB11_1","article-title":"Learnability and the Vapnik-Chervonenkis Dimension","author":"Blumer","year":"1987"},{"issue":"No.4","key":"10.1016\/0022-0000(90)90028-J_BIB11_2","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"Blumer","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90028-J_BIB12","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\/0022-0000(90)90028-J_BIB13_1","article-title":"On the Necessity of Occam Algorithms","author":"Board","year":"1989"},{"key":"10.1016\/0022-0000(90)90028-J_BIB13_2","series-title":"Proceedings, 22nd Annual ACM Symposium on Theory of Computing","author":"Board","year":"1990"},{"key":"10.1016\/0022-0000(90)90028-J_BIB14","series-title":"Proceedings, 19th Annual ACM Symposium on Theory of Computing","first-page":"123","article-title":"The Boolean formula value problem is in Alogtime","author":"Buss","year":"1987"},{"issue":"No.1","key":"10.1016\/0022-0000(90)90028-J_BIB15","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90028-J_BIB16","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. and Control"},{"issue":"No.2","key":"10.1016\/0022-0000(90)90028-J_BIB17","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\/0022-0000(90)90028-J_BIB18","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0890-5401(89)90001-1","article-title":"Learning decision trees from random examples","volume":"82","author":"Ehrenfeucht","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0022-0000(90)90028-J_BIB19","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","article-title":"A general lower bound on the number of examples needed for learning","volume":"82","author":"Ehrenfeucht","year":"1989","journal-title":"Inform. and Comput."},{"issue":"No.4","key":"10.1016\/0022-0000(90)90028-J_BIB20","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90028-J_BIB21","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","article-title":"Complexity of automaton identification from given data","volume":"37","author":"Gold","year":"1978","journal-title":"Inform. and Control"},{"issue":"No.4","key":"10.1016\/0022-0000(90)90028-J_BIB22","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","article-title":"How to construct random functions","volume":"33","author":"Goldreich","year":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90028-J_BIB23","series-title":"Proceedings, 29th Annual IEEE Symposium on Foundations of Computer Science","first-page":"12","article-title":"On the existence of pseudorandom generators","author":"Goldreich","year":"1988"},{"key":"10.1016\/0022-0000(90)90028-J_BIB24","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00289308","article-title":"Epsilon-productions in context-free grammars","volume":"16","author":"Goldschlager","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(90)90028-J_BIB25","article-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0022-0000(90)90028-J_BIB26_1","article-title":"Learning Conjunctive Concepts in Structural Domains","author":"Haussler","year":"1987"},{"issue":"No.1","key":"10.1016\/0022-0000(90)90028-J_BIB26_2","first-page":"7","volume":"4","author":"Haussler","year":"1989","journal-title":"Mach. Learning"},{"key":"10.1016\/0022-0000(90)90028-J_BIB27","unstructured":"D. Haussler, private communication, 1987."},{"key":"10.1016\/0022-0000(90)90028-J_BIB28","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0004-3702(88)90002-1","article-title":"Quantifying inductive bias: AI learning algorithms and Valiant's learning framework","volume":"36","author":"Haussler","year":"1988","journal-title":"Artif. Intell."},{"key":"10.1016\/0022-0000(90)90028-J_BIB29","series-title":"Space efficient learning algorithms","author":"Haussler","year":"1986"},{"key":"10.1016\/0022-0000(90)90028-J_BIB30","series-title":"Proceedings, 1988 Workshop on Computational Learning Theory","first-page":"42","article-title":"Equivalence of models for polynomial learnability","author":"Haussler","year":"1988"},{"key":"10.1016\/0022-0000(90)90028-J_BIB59","unstructured":"Inform. and Comput., to appear."},{"key":"10.1016\/0022-0000(90)90028-J_BIB31","series-title":"Proceedings, 29th Annual IEEE Symposium on Foundations of Computer Science","first-page":"100","article-title":"Predicting {0, 1 } functions on randomly drawn points","author":"Haussler","year":"1988"},{"key":"10.1016\/0022-0000(90)90028-J_BIB32","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02187876","article-title":"Epsilon-nets and simplex range queries","volume":"2","author":"Haussler","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0022-0000(90)90028-J_BIB33","series-title":"A compendium of problems complete for P","author":"Hoover","year":"1985"},{"key":"10.1016\/0022-0000(90)90028-J_BIB34","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","article-title":"Space-bounded reducibility among combinatorial problems","volume":"11","author":"Jones","year":"1975","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0022-0000(90)90028-J_BIB35","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","article-title":"Complete problems for deterministic polynomial time","volume":"3","author":"Jones","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(90)90028-J_BIB36","article-title":"The Computational Complexity of Machine Learning","author":"Kearns","year":"1989"},{"key":"10.1016\/0022-0000(90)90028-J_BIB37","series-title":"Proceedings, 19th Annual ACM Symposium on Theory of Computing","article-title":"On the learnability of Boolean formulae","author":"Kearns","year":"1987"},{"key":"10.1016\/0022-0000(90)90028-J_BIB38","series-title":"Proceedings, 4th International Workshop on Machine Learning","first-page":"337","article-title":"Recent results on Boolean concept learning","author":"Kearns","year":"1987"},{"key":"10.1016\/0022-0000(90)90028-J_BIB39","series-title":"Proceedings, 21st Annual ACM Symposium on Theory of Computing","first-page":"433","article-title":"Cryptographic limitations on learning Boolean formulae and finite automata","author":"Kearns","year":"1989"},{"issue":"No.1","key":"10.1016\/0022-0000(90)90028-J_BIB40","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","article-title":"The circuit value problem is log space complete for P","volume":"7","author":"Ladner","year":"1975","journal-title":"SIGACT News"},{"issue":"No.4","key":"10.1016\/0022-0000(90)90028-J_BIB41","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02579323","article-title":"One-way functions and pseudorandom generators","volume":"7","author":"Levin","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0022-0000(90)90028-J_BIB42","series-title":"Proceedings, 1988 Workshop on Computational Learning Theory","first-page":"359","article-title":"On the learnability of finite automata","author":"Li","year":"1988"},{"key":"10.1016\/0022-0000(90)90028-J_BIB43","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":"1987","journal-title":"Mach. Learning"},{"key":"10.1016\/0022-0000(90)90028-J_BIB44","series-title":"Proceedings, AII-89 Workshop on Analogical and Inductive Inference","first-page":"18","article-title":"Inductive inference, DFAs, and computational complexity","volume":"Vol. 397","author":"Pitt","year":"1989"},{"issue":"No.4","key":"10.1016\/0022-0000(90)90028-J_BIB45","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/48014.63140","article-title":"Computational limitations on learning from examples","volume":"35","author":"Pitt","year":"1988","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90028-J_BIB46","doi-asserted-by":"crossref","DOI":"10.1109\/SCT.1989.41829","article-title":"The Minimum Consistent DFA Problem Cannot Be Approximated within Any Polynomial","author":"Pitt","year":"1989"},{"key":"10.1016\/0022-0000(90)90028-J_BIB60_1","unstructured":"J. Assoc. Comput. Mach., to appear"},{"key":"10.1016\/0022-0000(90)90028-J_BIB60_2","series-title":"21st Annual ACM Symposium on Theory of Computing","article-title":"a preliminary version appears","author":"Pitt","year":"1989"},{"key":"10.1016\/0022-0000(90)90028-J_BIB47","series-title":"Proceedings, AAAI-88","article-title":"Tree-structured bias","author":"Russell","year":"1988"},{"key":"10.1016\/0022-0000(90)90028-J_BIB48","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(90)90028-J_BIB49","series-title":"The Complexity of Computing","author":"Savage","year":"1976"},{"key":"10.1016\/0022-0000(90)90028-J_BIB50","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1989.63451","article-title":"The strength of weak learnability","author":"Schapire","year":"1989"},{"key":"10.1016\/0022-0000(90)90028-J_BIB61","unstructured":"Mach. Learning, to appear."},{"key":"10.1016\/0022-0000(90)90028-J_BIB51","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/S0022-0000(75)80014-6","article-title":"On tape-bounded complexity classes of multihead finite automata","volume":"10","author":"Sudborough","year":"1975","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0022-0000(90)90028-J_BIB52","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/322077.322083","article-title":"On the tape complexity of deterministic context free languages","volume":"25","author":"Sudborough","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No, 11","key":"10.1016\/0022-0000(90)90028-J_BIB53","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"},{"issue":"No.2","key":"10.1016\/0022-0000(90)90028-J_BIB54","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"On the uniform convergence of relative frequencies of events to their probabilities","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theory Probab. Appl."},{"key":"10.1016\/0022-0000(90)90028-J_BIB55","series-title":"Proceedings, AII-89 Workshop on Analogical and Inductive Inference","first-page":"78","article-title":"Towards representation independence in PAC-learning","volume":"Vol. 397","author":"Warmuth","year":"1989"},{"key":"10.1016\/0022-0000(90)90028-J_BIB56","article-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987"},{"key":"10.1016\/0022-0000(90)90028-J_BIB57","series-title":"Proceedings, 23rd Annual IEEE Symposium on Foundations of Computer Science","first-page":"80","article-title":"Theory and applications of trapdoor functions","author":"Yao","year":"1982"},{"key":"10.1016\/0022-0000(90)90028-J_BIB58","unstructured":"C. K. Yap, \u201cTheory of Complexity Classes,\u201d Oxford Univ. Press, Oxford, to appear."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090028J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090028J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:56:00Z","timestamp":1550307360000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090028J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":65,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["002200009090028J"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90028-j","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}