{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T03:23:30Z","timestamp":1648869810852},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":[[2003,7]]},"DOI":"10.1016\/s0020-0190(03)00255-2","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T17:32:55Z","timestamp":1053365575000},"page":"73-78","source":"Crossref","is-referenced-by-count":0,"title":["Reduced Error Pruning of branching programs cannot be approximated to within a logarithmic factor"],"prefix":"10.1016","volume":"87","author":[{"given":"Richard","family":"Nock","sequence":"first","affiliation":[]},{"given":"Tapio","family":"Elomaa","sequence":"additional","affiliation":[]},{"given":"Matti","family":"K\u00e4\u00e4ri\u00e4inen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(03)00255-2_BIB001","series-title":"Classification and Regression Trees","author":"Breiman","year":"1984"},{"key":"10.1016\/S0020-0190(03)00255-2_BIB002","series-title":"Proceedings of the 9th Annual Conference on Computational Learning Theory","first-page":"224","article-title":"On learning width two branching programs","author":"Bshouty","year":"1996"},{"key":"10.1016\/S0020-0190(03)00255-2_BIB003","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1613\/jair.816","article-title":"An analysis of reduced error pruning","volume":"15","author":"Elomaa","year":"2001","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0020-0190(03)00255-2_BIB004","article-title":"The difficulty of reduced error pruning of leveled branching programs","author":"Elomaa","year":"2003","journal-title":"Ann. Math. Artificial Intelligence"},{"issue":"4","key":"10.1016\/S0020-0190(03)00255-2_BIB005","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","article-title":"A threshold of lnn for approximating set cover","volume":"45","author":"Feige","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(03)00255-2_BIB006","series-title":"Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems","first-page":"182","article-title":"Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT","author":"Feige","year":"1995"},{"key":"10.1016\/S0020-0190(03)00255-2_BIB007","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"4","key":"10.1016\/S0020-0190(03)00255-2_BIB008","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1145\/502090.502098","article-title":"Some optimal inapproximability results","volume":"48","author":"H\u00e5stad","year":"2001","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(03)00255-2_BIB009","series-title":"Proceedings of the 15th International Conference on Machine Learning","first-page":"269","article-title":"A fast, bottom-up decision tree pruning algorithm with near-optimal generalization","author":"Kearns","year":"1998"},{"key":"10.1016\/S0020-0190(03)00255-2_BIB010","series-title":"An Introduction to Computational Learning Theory","author":"Kearns","year":"1994"},{"issue":"1","key":"10.1016\/S0020-0190(03)00255-2_BIB011","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1006\/jcss.2001.1796","article-title":"Boosting using branching programs","volume":"64","author":"Mansour","year":"2002","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/S0020-0190(03)00255-2_BIB012","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0020-7373(87)80053-6","article-title":"Simplifying decision trees","volume":"27","author":"Quinlan","year":"1987","journal-title":"Internat. J. Man-Mach. Stud."},{"key":"10.1016\/S0020-0190(03)00255-2_BIB013","series-title":"C4.5: Programs for Machine Learning","author":"Quinlan","year":"1993"},{"key":"10.1016\/S0020-0190(03)00255-2_BIB014","series-title":"Proceedings of the 6th Annual ACM Conference on Computational Learning Theory","first-page":"27","article-title":"Learning \u03bc-branching programs with queries","author":"Raghavan","year":"1993"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002552?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002552?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T01:51:00Z","timestamp":1584669060000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019003002552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0020019003002552"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00255-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}