{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T14:04:24Z","timestamp":1770818664351,"version":"3.50.1"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T00:00:00Z","timestamp":1408406400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia, I.P.","award":["SFRH\/BD\/43169\/2008"],"award-info":[{"award-number":["SFRH\/BD\/43169\/2008"]}]},{"name":"National Science Foundation","award":["1064785"],"award-info":[{"award-number":["1064785"]}]},{"name":"National Science Foundation","award":["0832787"],"award-info":[{"award-number":["0832787"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>This paper is motivated by a conjecture that BPP can be characterized in\nterms of polynomial-time nonadaptive reductions to the set of Kolmogorov-random\nstrings. In this paper we show that an approach laid out in [Allender et al] to\nsettle this conjecture cannot succeed without significant alteration, but that\nit does bear fruit if we consider time-bounded Kolmogorov complexity instead.\nWe show that if a set A is reducible in polynomial time to the set of\ntime-t-bounded Kolmogorov random strings (for all large enough time bounds t),\nthen A is in P\/poly, and that if in addition such a reduction exists for any\nuniversal Turing machine one uses in the definition of Kolmogorov complexity,\nthen A is in PSPACE.<\/jats:p>","DOI":"10.2168\/lmcs-10(3:5)2014","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T09:40:57Z","timestamp":1415958057000},"source":"Crossref","is-referenced-by-count":4,"title":["Reductions to the set of random strings: The resource-bounded case"],"prefix":"10.46298","volume":"Volume 10, Issue 3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0650-028X","authenticated-orcid":false,"given":"Eric","family":"Allender","sequence":"first","affiliation":[]},{"given":"Harry","family":"Buhrman","sequence":"additional","affiliation":[]},{"given":"Luke","family":"Friedman","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7562-457X","authenticated-orcid":false,"given":"Bruno","family":"Loff","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2014,8,19]]},"reference":[{"key":"809:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/723\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/723\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:54:41Z","timestamp":1681242881000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,19]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-10(3:5)2014","relation":{"is-same-as":[{"id-type":"arxiv","id":"1406.7658","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1406.7658","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"doi","id":"10.1007\/978-3-319-50062-1_6","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,19]]},"article-number":"723"}}