{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:25:25Z","timestamp":1648916725485},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":4215,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0304-3975(01)00039-1","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T09:27:27Z","timestamp":1034674047000},"page":"181-200","source":"Crossref","is-referenced-by-count":4,"title":["General linear relations between different types of predictive complexity"],"prefix":"10.1016","volume":"271","author":[{"given":"Yuri","family":"Kalnishkan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0304-3975(01)00039-1_BIB1","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/258128.258179","article-title":"How to use expert advice","volume":"44","author":"Cesa-Bianchi","year":"1997","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00039-1_BIB2","volume":"vol. 1","author":"Courant","year":"1948"},{"key":"10.1016\/S0304-3975(01)00039-1_BIB3","doi-asserted-by":"crossref","unstructured":"A. DeSantis, G. Markowski, M.N. Weigman, Learning probabilistic prediction functions, in: Proc. 1988 Workshop on Computational Learning Theory, 1988, pp. 312\u2013328.","DOI":"10.1109\/SFCS.1988.21929"},{"key":"10.1016\/S0304-3975(01)00039-1_BIB4","series-title":"Convexity","author":"Eggleston","year":"1958"},{"key":"10.1016\/S0304-3975(01)00039-1_BIB5","doi-asserted-by":"crossref","unstructured":"D. Haussler, J. Kivinen, M.K. Warmuth, Tight worst-case loss bounds for predicting with expert advice, Tech. Report UCSC-CRL-94-36, University of California at Santa Cruz, revised December 1994.","DOI":"10.1007\/3-540-59119-2_169"},{"key":"10.1016\/S0304-3975(01)00039-1_BIB6","series-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"Li","year":"1997"},{"key":"10.1016\/S0304-3975(01)00039-1_BIB7","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1006\/inco.1994.1009","article-title":"The weighted majority algorithm","volume":"108","author":"Littlestone","year":"1994","journal-title":"Inform. and Comput."},{"issue":"4","key":"10.1016\/S0304-3975(01)00039-1_BIB8","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1093\/comjnl\/42.4.260","article-title":"Hypothesis selection and testing by the MDL principle","volume":"42","author":"Rissanen","year":"1999","journal-title":"Comput. J."},{"issue":"4","key":"10.1016\/S0304-3975(01)00039-1_BIB9","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1093\/comjnl\/42.4.318","article-title":"Complexity approximation principle","volume":"42","author":"Vovk","year":"1999","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(01)00039-1_BIB10","doi-asserted-by":"crossref","unstructured":"V. Vovk, Aggregating strategies, in: M. Fulk, J. Case (Eds.), Proc. Third Ann. Workshop on Computational Learning Theory, Morgan Kaufmann, San Mateo, CA, 1990,, pp. 371\u2013383.","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"key":"10.1016\/S0304-3975(01)00039-1_BIB11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0304-3975(00)00133-X","article-title":"Probability theory for the Brier game","volume":"261","author":"Vovk","year":"2001","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/S0304-3975(01)00039-1_BIB12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/jcss.1997.1556","article-title":"A game of prediction with expert advice","volume":"56","author":"Vovk","year":"1998","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(01)00039-1_BIB13","doi-asserted-by":"crossref","unstructured":"V. Vovk, C.J.H.C. Watkins, Universal portfolio selection, in: Proc. 11th Ann. Conf. on Computational Learning Theory, 1998, pp. 12\u201323.","DOI":"10.1145\/279943.279947"},{"key":"10.1016\/S0304-3975(01)00039-1_BIB14","first-page":"357","article-title":"Algorithmic entropy (complexity) of finite objects and its applications to defining randomness and amount of information","volume":"13","author":"V'yugin","year":"1994","journal-title":"Selecta Math. Formerly Sovietica"},{"issue":"4","key":"10.1016\/S0304-3975(01)00039-1_BIB15","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1093\/comjnl\/42.4.270","article-title":"Minimum message length and Kolmogorov complexity","volume":"42","author":"Wallace","year":"1999","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(01)00039-1_BIB16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","article-title":"The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms","volume":"25","author":"Zvonkin","year":"1970","journal-title":"Russian Math. Surveys"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000391?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000391?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T20:25:30Z","timestamp":1578428730000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0304397501000391"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00039-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}