{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:11:52Z","timestamp":1649117512278},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5160,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0304-3975(99)00024-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"3-18","source":"Crossref","is-referenced-by-count":4,"title":["Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs"],"prefix":"10.1016","volume":"221","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\u00e9D.P.","family":"Rolim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00024-9_bib1","series-title":"19th ACM Symp. on Theory of Computing","first-page":"132","article-title":"Deterministic simulation in LOGSPACE","author":"Ajtai","year":"1987"},{"key":"10.1016\/S0304-3975(99)00024-9_bib2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02579166","article-title":"Eigenvalues and expanders","volume":"6","author":"Alon","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(99)00024-9_bib3","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"issue":"1","key":"10.1016\/S0304-3975(99)00024-9_bib4","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/273865.273933","article-title":"A new general derandomization method","volume":"45","author":"Andreev","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00024-9_bib5","series-title":"38th IEEE Foundations of Computer Science","article-title":"Weak random sources, hitting sets, and BPP simulation","author":"Andreev","year":"1997"},{"issue":"4","key":"10.1016\/S0304-3975(99)00024-9_bib6","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","article-title":"How to generate cryptographically strong sequences of pseudorandom bits","volume":"13","author":"Blum","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00024-9_bib7","series-title":"30th IEEE Symp. on Foundations of Computer Science","first-page":"14","article-title":"Dispersers, deterministic amplification, and weak random sources","author":"Cohen","year":"1989"},{"key":"10.1016\/S0304-3975(99)00024-9_bib8","series-title":"29th ACM Symp. on Theory of Computing","first-page":"220","article-title":"P = BPP if E requires exponential circuits: derandomizing the XOR lemma","author":"Impagliazzo","year":"1997"},{"key":"10.1016\/S0304-3975(99)00024-9_bib9","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, A. Wigderson, private communication, 1997.","DOI":"10.1145\/258533.258590"},{"issue":"3","key":"10.1016\/S0304-3975(99)00024-9_bib10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","article-title":"Ramanujan graphs","volume":"8","author":"Lubotzky","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(99)00024-9_bib11","first-page":"1171","article-title":"About gating and contact-gating circuits","volume":"111","author":"Lupanov","year":"1956","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/S0304-3975(99)00024-9_bib12","first-page":"31","article-title":"About a method circuits design - local coding principle","volume":"10","author":"Lupanov","year":"1965","journal-title":"Problemy Kibernet."},{"key":"10.1016\/S0304-3975(99)00024-9_bib13","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0304-3975(99)00024-9_bib14","first-page":"40","article-title":"About the complexity of gating circuits for the partial Boolean matrix","volume":"163","author":"Nechiporuk","year":"1965","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/S0304-3975(99)00024-9_SB0070","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","article-title":"Hardness vs randomness","volume":"49","author":"Nisan","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00024-9_SB0075","series-title":"29th IEEE Foundations of Computer Science","author":"Nisan","year":"1988"},{"key":"10.1016\/S0304-3975(99)00024-9_bib16","series-title":"11th IEEE Conf. on Computational Complexity","first-page":"44","article-title":"Extracting randomness: how and why","author":"Nisan","year":"1996"},{"key":"10.1016\/S0304-3975(99)00024-9_bib17","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0304-3975(99)00024-9_bib18","series-title":"27th ACM Symp. on Theory of Computing","first-page":"479","article-title":"Explicit dispersers with polylog degree","author":"Sacks","year":"1995"},{"key":"10.1016\/S0304-3975(99)00024-9_bib19","article-title":"Explicit dispersers with polylog degree","author":"Saks","year":"1997","journal-title":"International Journal"},{"key":"10.1016\/S0304-3975(99)00024-9_bib20","series-title":"28th IEEE Foundations of Computer Science","first-page":"264","article-title":"Computing with very weak random sources","author":"Srinvasan","year":"1994"},{"key":"10.1016\/S0304-3975(99)00024-9_bib21","series-title":"28th ACM Symposium on Theory of Computing","first-page":"276","article-title":"On extracting randomness from weak random sources","author":"Ta-Shma","year":"1996"},{"key":"10.1016\/S0304-3975(99)00024-9_bib22","article-title":"The complexity of finite Boolean functions","author":"Wegener","year":"1987","journal-title":"Wiley-Teubner Series in Computer Science"},{"key":"10.1016\/S0304-3975(99)00024-9_bib23","series-title":"23th IEEE Foundations of Computer Science","first-page":"80","article-title":"Theory and applications of trapdoor functions","author":"Yao","year":"1982"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000249?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000249?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:27:42Z","timestamp":1556508462000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397599000249"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00024-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}