{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:47:59Z","timestamp":1725468479691},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055824","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:36:31Z","timestamp":1155836191000},"page":"732-739","source":"Crossref","is-referenced-by-count":2,"title":["Comparison between the complexity of a function and the complexity of its graph"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Durand","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Porrot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"71_CR1","doi-asserted-by":"crossref","unstructured":"C. Calude. Information and Randomness, an Algorithmic Perspective. Springer-Verlag, 1994.","DOI":"10.1007\/978-3-662-03049-3"},{"key":"71_CR2","doi-asserted-by":"crossref","unstructured":"B. Durand, Alexander Shen, and Nikolai Vereshchagin. Descriptive complexity of computable sequences. Draft, 1998.","DOI":"10.1007\/3-540-49116-3_14"},{"key":"71_CR3","doi-asserted-by":"crossref","unstructured":"M. Li and P. Vit\u00e1nyi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, 2 edition, 1997.","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"71_CR4","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/S0019-9958(69)90538-5","volume":"15","author":"D. W. Loveland","year":"1969","unstructured":"D. W. Loveland. A variant of the Kolmogorov concept of complexity. Information and Control, 15:510\u2013526, 1969.","journal-title":"Information and Control"},{"key":"71_CR5","doi-asserted-by":"crossref","unstructured":"S. Porrot, M. Dauchet, B. Durand, and N. Vereshchagin. Deterministic rational transducers and random sequences. In FOSSACS'98, volume 1378 of Lecture Notes in Computer Science, pages 258\u2013272. Springer-Verlag, march 1998.","DOI":"10.1007\/BFb0053555"},{"issue":"3","key":"71_CR6","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/BF01201280","volume":"29","author":"V. A. Uspensky","year":"1996","unstructured":"V. A. Uspensky and A. Shen. Relations between varieties of Kolmogorov complexities. Math. Syst. Theory, 29(3):270\u2013291, 1996.","journal-title":"Math. Syst. Theory"},{"issue":"6","key":"71_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1070\/rm1970v025n06ABEH001269","volume":"25","author":"A.K. Zvonkin","year":"1970","unstructured":"A.K. Zvonkin and L.A. Levin. The complexity of finite objects and the development of the concepts of information and randomness by means of theory of algorithms. Russian Math. Surveys, 25(6):83\u2013124, 1970.","journal-title":"Russian Math. Surveys"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T18:44:19Z","timestamp":1555785859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0055824","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}