{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:44:24Z","timestamp":1750308264923,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6,13]]},"DOI":"10.1145\/1007352.1007389","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"192-201","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Using nondeterminism to amplify hardness"],"prefix":"10.1145","author":[{"given":"Alexander","family":"Healy","sequence":"first","affiliation":[{"name":"Harvard University, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salil","family":"Vadhan","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuele","family":"Viola","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"volume-title":"Dover Publications Inc.","year":"2002","author":"Anderson Ian","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200056"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/90326.90342"},{"key":"e_1_3_2_1_4_1","first-page":"91","volume-title":"Randomness and Computation","author":"Ben-Or Michael","year":"1990"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946341"},{"key":"e_1_3_2_1_6_1","series-title":"Lecture Notes in Computer Science","volume-title":"16th International Symposium on Theoretical Aspects of Computer Science","author":"Cai Jin-Yi","year":"1999"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01262928"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222061"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796290"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195190"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796431"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21923"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022949332276"},{"volume-title":"Proceedings of DIMACS Workshop on Distributed Computing and Cryptography","year":"1989","author":"Lipton Richard","key":"e_1_3_2_1_17_1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10097"},{"key":"e_1_3_2_1_19_1","first-page":"12","article-title":"Pseudorandom generators for space-bounded computation","author":"Nisan","year":"1992","journal-title":"Combinatorica"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01375474"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80043-1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510015"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1730"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946354"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/872747.873197"},{"key":"e_1_3_2_1_26_1","unstructured":"Emanuele Viola. The complexity of constructing pseudorandom generators from hard functions. Technical report Electronic Colloquium on Computational Complexity 2004. http:\/\/www. eccc. uni-trier. de\/eccc. Preliminary version titled 'Hardness vs. Randomness within Alternating Time' in Eighteenth Annual IEEE Conference on Computational Complexity.  Emanuele Viola. The complexity of constructing pseudorandom generators from hard functions. Technical report Electronic Colloquium on Computational Complexity 2004. http:\/\/www. eccc. uni-trier. de\/eccc. Preliminary version titled 'Hardness vs. Randomness within Alternating Time' in Eighteenth Annual IEEE Conference on Computational Complexity."},{"key":"e_1_3_2_1_27_1","first-page":"80","volume-title":"Proceedings of 23rd FOCS","author":"Yao Andrew C.","year":"1982"}],"event":{"name":"STOC04: Symposium of Theory of Computing 2004","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"STOC04"},"container-title":["Proceedings of the thirty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007389","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007352.1007389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:23:55Z","timestamp":1750267435000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":26,"alternative-id":["10.1145\/1007352.1007389","10.1145\/1007352"],"URL":"https:\/\/doi.org\/10.1145\/1007352.1007389","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}