{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T16:49:22Z","timestamp":1780505362338,"version":"3.54.1"},"reference-count":6,"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)00033-0","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T09:27:27Z","timestamp":1034674047000},"page":"97-109","source":"Crossref","is-referenced-by-count":45,"title":["Conditional complexity and codes"],"prefix":"10.1016","volume":"271","author":[{"given":"Andrej A.","family":"Muchnik","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0304-3975(01)00033-0_BIB1","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1109\/18.681318","article-title":"Information distance","volume":"44","author":"Bennett","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(01)00033-0_BIB2","first-page":"84","volume":"Vol. 1373","author":"Fortnow","year":"1998"},{"key":"10.1016\/S0304-3975(01)00033-0_BIB3","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0304-3975(98)00074-7","article-title":"On a complexity of the formula ((A\u2228 B)\u2192 C)","volume":"207","author":"Gorbunov","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00033-0_BIB4","series-title":"An introduction to Kolmogorov Complexity and Its Applications","author":"Li","year":"1997"},{"key":"10.1016\/S0304-3975(01)00033-0_BIB5","unstructured":"A. Muchnik, A. Semenov, Multi-conditional descriptions and codes in kolmogorov complexity, Electronic Colloquium on Computational Complexity, Report No. 15, January 27, 2000."},{"key":"10.1016\/S0304-3975(01)00033-0_BIB6","doi-asserted-by":"crossref","unstructured":"N.K. Vereshchagin, M.V. Vyugin, Independent minimum length programs to translate between given strings, Theoret. Comput. Sci., this issue.","DOI":"10.1109\/CCC.2000.856744"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000330?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000330?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T06:23:37Z","timestamp":1556864617000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":6,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0304397501000330"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00033-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}