{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:22Z","timestamp":1761611122314,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2003.1214421","type":"proceedings-article","created":{"date-parts":[[2004,1,24]],"date-time":"2004-01-24T04:33:03Z","timestamp":1074918783000},"page":"209-220","source":"Crossref","is-referenced-by-count":5,"title":["Derandomization and distinguishing complexity"],"prefix":"10.1109","author":[{"given":"E.","family":"Allender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Koucky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Ronneburger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Sambuddha Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80060-1"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335314"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700389652"},{"key":"15","first-page":"2","article-title":"In search of an easy witness: Exponential time vs. probabilistic polynomial time","author":"impagliazzo","year":"2001","journal-title":"IEEE Conf Computational Complexity"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814590"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00025-9"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2001.933869"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00097-6"},{"journal-title":"Some NP-complete set covering problems","year":"1979","author":"masek","key":"21"},{"key":"20","first-page":"120","article-title":"A method of circuit synthesis","volume":"1","author":"lupanov","year":"1959","journal-title":"Izvestiya Vuzov Radiofizika"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814579"},{"key":"23","first-page":"458","article-title":"Number-theoretic constructions of efficient pseudorandom functions","author":"naor","year":"1997","journal-title":"Proc 40th IEEE Symp Foundations of Computer Science (FOCS)"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80043-1"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63248-4_8"},{"key":"26","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1109\/SFCS.2001.959941","article-title":"Simple extractors for all minentropies and a new pseudo-random generator","author":"shaltiel","year":"2001","journal-title":"Proc 40th IEEE Symp Foundations of Computer Science (FOCS)"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181992"},{"key":"2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-45294-X_1","article-title":"When worlds collide: Derandomization, lower bounds, and Kolmogorov complexity","volume":"2245","author":"allender","year":"2001","journal-title":"Lecture Notes in Computer Science"},{"journal-title":"The Complexity of Minimizing Disjunctive Normal form Fomulas","year":"1999","author":"czort","key":"10"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90021-4"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00047-2"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01275486"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1142\/S012905419500010X"},{"key":"4","article-title":"Graph isomorphism is low for ZPPNP and other lowness results","volume":"tr99 33","author":"arvind","year":"1999","journal-title":"Technical Report"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80026-1"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979834388X"}],"event":{"name":"18th IEEE Annual Conference on Computational Complexity","acronym":"CCC-03","location":"Aarhus, Denmark"},"container-title":["18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8614\/27296\/01214421.pdf?arnumber=1214421","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T07:52:29Z","timestamp":1585468349000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1214421\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/ccc.2003.1214421","relation":{},"subject":[]}}