{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:33:57Z","timestamp":1757615637221,"version":"3.44.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,2,10]],"date-time":"1999-02-10T00:00:00Z","timestamp":918604800000},"content-version":"vor","delay-in-days":1136,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1016\/0020-0190(95)00201-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:21:21Z","timestamp":1027606881000},"page":"59-64","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["A High-Low Kolmogorov Complexity Law equivalent to the 0\u20131 Law"],"prefix":"10.1016","volume":"57","author":[{"given":"Marius","family":"Zimand","sequence":"first","affiliation":[]}],"member":"78","reference":[{"year":"1985","author":"Bollob\u00e1s","series-title":"Random Graphs","key":"10.1016\/0020-0190(95)00201-4_BIB1"},{"unstructured":"R. Book, On languages reducible to algorithmically random languages, SIAM J. Comput., to appear.","key":"10.1016\/0020-0190(95)00201-4_BIB2"},{"year":"1994","author":"Calude","series-title":"Information and Randomness: An Algorithmic Perspective","key":"10.1016\/0020-0190(95)00201-4_BIB3"},{"key":"10.1016\/0020-0190(95)00201-4_BIB4","series-title":"NATO Adv. Study Inst. on Algorithms and Order","first-page":"353","article-title":"0\u20131 laws in logic and combinatorics","author":"Compton","year":"1988"},{"key":"10.1016\/0020-0190(95)00201-4_BIB5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.2307\/2272945","article-title":"Probabilities on finite models","volume":"41","author":"Fagin","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0020-0190(95)00201-4_BIB6","first-page":"17","article-title":"Range and degree of realizability of formulas in the restricted predicate calculus","volume":"2","author":"Glebskii","year":"1969","journal-title":"Kibernetika (Kiev)"},{"key":"10.1016\/0020-0190(95)00201-4_BIB7","series-title":"Proc. 19th ACM Symp. on Theory of Computing","first-page":"425","article-title":"The decision problem for the probabilities of higher-order properties","author":"Kolaitis","year":"1987"},{"key":"10.1016\/0020-0190(95)00201-4_BIB8","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0890-5401(92)90021-7","article-title":"Infinitary logics and 0\u20131 laws","volume":"98","author":"Kolaitis","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(95)00201-4_BIB9","first-page":"187","article-title":"Kolmogorov complexity and its applications","author":"Li","year":"1990"},{"year":"1993","author":"Li","series-title":"An Introduction to Kolmogorov Complexity and its Applications","key":"10.1016\/0020-0190(95)00201-4_BIB10"},{"key":"10.1016\/0020-0190(95)00201-4_BIB11","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"year":"1995","author":"Tyszkiewicz","series-title":"Kolmogorov complexity for finite-model theory, manuscript, to be presented at CSL'95","key":"10.1016\/0020-0190(95)00201-4_BIB12"},{"key":"10.1016\/0020-0190(95)00201-4_BIB13","series-title":"Proc. ICDT'95","article-title":"On the Kolmogorov expressive power of boolean query languages","volume":"893","author":"Tyszkiewicz","year":"1995"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095002014?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095002014?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T14:58:33Z","timestamp":1757084313000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019095002014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["0020019095002014"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00201-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1996,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A High-Low Kolmogorov Complexity Law equivalent to the 0\u20131 Law","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0190(95)00201-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}