{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T10:19:50Z","timestamp":1649067590653},"reference-count":8,"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)00029-9","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T09:27:27Z","timestamp":1034674047000},"page":"37-46","source":"Crossref","is-referenced-by-count":2,"title":["Comparison between the complexity of a function and the complexity of its graph"],"prefix":"10.1016","volume":"271","author":[{"given":"Bruno","family":"Durand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Porrot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00029-9_BIB1","series-title":"Information and Randomness","author":"Calude","year":"1994"},{"key":"10.1016\/S0304-3975(01)00029-9_BIB2","doi-asserted-by":"crossref","unstructured":"B. Durand, S. Porrot, in: Comparison between the complexity of a function and the complexity of its graph, MFCS\u201998, Lecture Notes in Computer Science, Springer, Berlin, 1998.","DOI":"10.1007\/BFb0055824"},{"key":"10.1016\/S0304-3975(01)00029-9_BIB3","doi-asserted-by":"crossref","unstructured":"B. Durand, A. Shen, N. Vereshchagin, Descriptive complexity of computable sequences, Theoret. Comput. Sci. 271 (this Vol.) (2002) 47\u201358.","DOI":"10.1016\/S0304-3975(01)00030-5"},{"key":"10.1016\/S0304-3975(01)00029-9_BIB4","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1997"},{"key":"10.1016\/S0304-3975(01)00029-9_BIB5","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/S0019-9958(69)90538-5","article-title":"A variant of the Kolmogorov concept of complexity","volume":"15","author":"Loveland","year":"1969","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(01)00029-9_BIB6","doi-asserted-by":"crossref","unstructured":"S. Porrot, M. Dauchet, B. Durand, N. Vereshchagin, Deterministic rational transducers and random sequences, FOSSACS\u201998, Lecture Notes in Computer Science, Springer, Berlin, 1998.","DOI":"10.1007\/BFb0053555"},{"issue":"3","key":"10.1016\/S0304-3975(01)00029-9_BIB7","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/BF01201280","article-title":"Relations between varieties of Kolmogorov complexities","volume":"29","author":"Uspensky","year":"1996","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(01)00029-9_BIB8","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:S0304397501000299?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000299?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:28Z","timestamp":1578428728000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0304397501000299"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00029-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}