{"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":1770818664260,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/ccc.2010.15","type":"proceedings-article","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T14:21:40Z","timestamp":1278944500000},"page":"58-63","source":"Crossref","is-referenced-by-count":7,"title":["Derandomizing from Random Strings"],"prefix":"10.1109","author":[{"given":"Harry","family":"Buhrman","sequence":"first","affiliation":[]},{"given":"Lance","family":"Fortnow","sequence":"additional","affiliation":[]},{"given":"Michal","family":"Kouck\u00fd","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Loff","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","first-page":"1251","article-title":"Complexity of programs to determine whether natural numbers not greater than $n$ belong to a recursively enumerable set","volume":"9","author":"barzdin","year":"1968","journal-title":"Soviet Mathematics Doklady"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200056"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146609"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1484"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2002.1004348"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301428"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04650-0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181992"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-49820-1","author":"li","year":"2008","journal-title":"An Introduction to Kolmogorov Complexity and Its Applications"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2005.06.003"}],"event":{"name":"2010 IEEE 25th Annual Conference on Computational Complexity (CCC)","location":"Cambridge, MA, USA","start":{"date-parts":[[2010,6,9]]},"end":{"date-parts":[[2010,6,12]]}},"container-title":["2010 IEEE 25th Annual Conference on Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5497049\/5497861\/05497897.pdf?arnumber=5497897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T10:42:50Z","timestamp":1497868970000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5497897\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/ccc.2010.15","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}