{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:31:15Z","timestamp":1740547875771,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_51","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:01:54Z","timestamp":1283972514000},"page":"584-595","source":"Crossref","is-referenced-by-count":2,"title":["What Can be Efficiently Reduced to the K-Random Strings?"],"prefix":"10.1007","author":[{"given":"Eric","family":"Allender","sequence":"first","affiliation":[]},{"given":"Harry","family":"Buhrman","sequence":"additional","affiliation":[]},{"given":"Michal","family":"Kouck\u00fd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Allender, E., Buhrman, H., Kouck\u00fd, M., van Melkebeek, D., Ronneburger, D.: Power from random strings. In: FOCS: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 669\u2013678 (2002)","key":"51_CR1","DOI":"10.1109\/SFCS.2002.1181992"},{"key":"51_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0206023","volume":"6","author":"L. Berman","year":"1977","unstructured":"Berman, L., Hartmanis, J.: On isomorphisms and density of NP and other complete sets. SIAM Journal on Computing\u00a06, 305\u2013323 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"51_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-60922-9_3","volume-title":"STACS 96","author":"M. Kummer","year":"1996","unstructured":"Kummer, M.: On the complexity of random strings. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 25\u201336. Springer, Heidelberg (1996)"},{"key":"51_CR4","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","volume":"50","author":"E.L. Post","year":"1944","unstructured":"Post, E.L.: Recursively enumerable sets of positive integers and their decision problems. Bulletin of American Mathematical Society\u00a050, 284\u2013316 (1944)","journal-title":"Bulletin of American Mathematical Society"},{"key":"51_CR5","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/BF01762189","volume":"8","author":"C.P. Schnorr","year":"1974","unstructured":"Schnorr, C.P.: Optimal enumerations and optimal G\u00f6del numberings. Mathematical Systems Theory\u00a08, 182\u2013191 (1974)","journal-title":"Mathematical Systems Theory"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T17:08:21Z","timestamp":1740503301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}