{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:06Z","timestamp":1725664986146},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631651"},{"type":"electronic","value":"9783540691945"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63165-8_175","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:10:42Z","timestamp":1330297842000},"page":"177-187","source":"Crossref","is-referenced-by-count":10,"title":["Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs"],"prefix":"10.1007","author":[{"given":"Alexander E.","family":"Andreev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea E. F.","family":"Clementi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 D. P.","family":"Rolim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai M, Komlos J, and Szemeredi E. (1987), Deterministic simulation in LOGSPACE, Proc. of 19th ACM STOC, 132\u2013140.","DOI":"10.1145\/28395.28410"},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02579166","volume":"6","author":"N. Alon","year":"1986","unstructured":"Alon N. (1986), \u201cEigenvalues and Expanders\u201d, Combinatorica, 6, 83\u201396.","journal-title":"Combinatorica"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Andreev A., Clementi A., and Rolim J. (1996), \u201cHitting Sets Derandomize BPP\u201d, in XXIII International Colloquium on Algorithms, Logic and Programming (ICALP'96), LNCS. Also available via ftp\/WWW in the electronic journal ECCC (TR95-061)","DOI":"10.1007\/3-540-61440-0_142"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Andreev A., Clementi A., Rolim J and Trevisan L. (1997), Weak Random Sources, Hitting Sets, and BPP Simulations\u201d, Manuscript, February 1997.","DOI":"10.1007\/3-540-61440-0_142"},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum M., and Micali S. (1984), \u201cHow to generate cryptographically strong sequences of pseudorandom bits\u201d, SIAM J. of Computing, 13(4), 850\u2013864.","journal-title":"SIAM J. of Computing"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Impagliazzo R., Wigderson A. (1997), \u201cP=BPP unless E has subexponential circuits: Derandomizing the XOR Lemma\u201d, to appear in 29th ACM STOC.","DOI":"10.1145\/258533.258590"},{"issue":"3","key":"17_CR7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"A. Lubotzky, R. Phillips, and P. Sarnak. (1988), \u201cRamanujan graphs\u201d, Combinatorica, 8(3):261\u2013277, 1988.","journal-title":"Combinatorica"},{"key":"17_CR8","first-page":"1171","volume":"111","author":"O.B. Lupanov","year":"1956","unstructured":"Lupanov, O.B. (1956) \u201cAbout gating and contact-gating circuits\u201d, Dokl. Akad. Nauk SSSR 111, 1171\u201311744.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"17_CR9","first-page":"31","volume":"10","author":"O.B. Lupanov","year":"1965","unstructured":"Lupanov, O.B. (1965), \u201cAbout a method circuits design \u2014 local coding principle\u201d, Problemy Kibernet. 10, 31\u2013110 (in Russian).","journal-title":"Problemy Kibernet"},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N. Nisan","year":"1994","unstructured":"Nisan N., and Wigderson A. (1994), \u201cHardness vs Randomness\u201d, J. Comput. System Sci. 49, 149\u2013167 (also presented at the 29th IEEE FOCS, 1988).","journal-title":"J. Comput. System Sci"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Wegener, I. (1987), The complexity of finite Boolean functions, Wiley-Teubner Series in Computer Science.","DOI":"10.1007\/3-540-18170-9_185"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Yao A. (1982), \u201cTheory and applications of trapdoor functions\u201d, in 23th IEEE FOCS, 80\u201391.","DOI":"10.1109\/SFCS.1982.45"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Zuckermann D. (1996), \u201cRandomness-Optimal Sampling, Extractors, and Constructive leader Election\u201d, in 28th ACM STOC, 286\u2013295.","DOI":"10.1145\/237814.237878"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63165-8_175.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:36:07Z","timestamp":1640950567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63165-8_175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631651","9783540691945"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-63165-8_175","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}