{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:04:23Z","timestamp":1775282663366,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":3607,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0022-0000(03)00046-1","type":"journal-article","created":{"date-parts":[[2003,6,21]],"date-time":"2003-06-21T00:11:16Z","timestamp":1056154276000},"page":"419-440","source":"Crossref","is-referenced-by-count":67,"title":["Pseudo-random generators for all hardnesses"],"prefix":"10.1016","volume":"67","author":[{"given":"Christopher","family":"Umans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0022-0000(03)00046-1_BIB1","doi-asserted-by":"crossref","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\/S0022-0000(03)00046-1_BIB2","doi-asserted-by":"crossref","unstructured":"A.E. Andreev, A.E.F. Clementi, J.D.P. Rolim, L. Trevisan, Weak random sources, hitting sets, and BPP simulations, in: 38th Annual Symposium on Foundations of Computer Science, Miami Beach, FL, 20\u201322 October, IEEE, New York, 1997, pp. 264\u2013272.","DOI":"10.1109\/SFCS.1997.646115"},{"issue":"4","key":"10.1016\/S0022-0000(03)00046-1_BIB3","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF01275486","article-title":"BPP has subexponential time simulations unless EXPTIME has publishable proofs","volume":"3","author":"Babai","year":"1993","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0022-0000(03)00046-1_BIB4","doi-asserted-by":"crossref","unstructured":"M. Bellare, J. Rompel, Randomness-efficient oblivious sampling, in: 35th Annual Symposium on Foundations of Computer Science, 1994.","DOI":"10.1109\/SFCS.1994.365687"},{"issue":"4","key":"10.1016\/S0022-0000(03)00046-1_BIB5","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","article-title":"How to generate cryptographically strong sequences of pseudo-random bits","volume":"13","author":"Blum","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00046-1_BIB6","unstructured":"O. Goldreich, S. Vadhan, A. Wigderson, Simplified derandomization of BPP using a hitting set generator, Technical Report TR00-004, Electronic Colloquium on Computational Complexity, January 2000."},{"key":"10.1016\/S0022-0000(03)00046-1_BIB7","doi-asserted-by":"crossref","unstructured":"V. Guruswami, M. Sudan, List decoding algorithms for certain concatenated codes, in: Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000.","DOI":"10.1145\/335305.335327"},{"key":"10.1016\/S0022-0000(03)00046-1_BIB8","unstructured":"V. Guruswami, M. Sudan, Extensions to the Johnson bound, Manuscript, February 2001."},{"key":"10.1016\/S0022-0000(03)00046-1_BIB9","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, Hard-core distributions for somewhat hard problems. In 36th Annual Symposium on Foundations of Computer Science, Milwaukee, WI, 23\u201325 October, IEEE, New York, 1995, pp. 538\u2013545.","DOI":"10.1109\/SFCS.1995.492584"},{"key":"10.1016\/S0022-0000(03)00046-1_BIB10","unstructured":"R. Impagliazzo, V. Kabanets, A. Wigderson, In search of an easy witness: Exponential time vs. probabilistic polynomial time, in: Sixteenth Annual IEEE Conference on Computational Complexity, 2001, pp. 1\u201312; J. Comput. System Sci., to appear."},{"key":"10.1016\/S0022-0000(03)00046-1_BIB11","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, R. Shaltiel, A. Wigderson, Near-optimal conversion of hardness into pseudo-randomness, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999.","DOI":"10.1109\/SFFCS.1999.814590"},{"key":"10.1016\/S0022-0000(03)00046-1_BIB12","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, R. Shaltiel, A. Wigderson, Extractors and pseudo-random generators with optimal seed-length, in: Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing, 21\u201323 May 2000.","DOI":"10.1145\/335305.335306"},{"key":"10.1016\/S0022-0000(03)00046-1_BIB13","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, A. Wigderson, P=BPP if E requires exponential circuits: Derandomizing the XOR lemma, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, Texas, 4\u20136 May 1997, pp. 220\u2013229.","DOI":"10.1145\/258533.258590"},{"issue":"2","key":"10.1016\/S0022-0000(03)00046-1_BIB14","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1006\/jcss.2001.1763","article-title":"Easiness assumptions and hardness tests","volume":"63","author":"Kabanets","year":"2001","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(03)00046-1_BIB15","doi-asserted-by":"crossref","unstructured":"A.R. Klivans, D. van Melkebeek, Graph nonisomorphism has subexponential size proofs unless the polynomial-times hierarchy collapses, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, SIAM J. Comput., to appear.","DOI":"10.1145\/301250.301428"},{"key":"10.1016\/S0022-0000(03)00046-1_BIB16","series-title":"Algebra","author":"Lang","year":"1993"},{"issue":"3","key":"10.1016\/S0022-0000(03)00046-1_BIB17","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s00037-001-8196-9","article-title":"Derandomizing Arthur\u2013Merlin games under uniform assumptions","volume":"10","author":"Lu","year":"2001","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0022-0000(03)00046-1_BIB18","doi-asserted-by":"crossref","unstructured":"P.B. Miltersen, N.V. Vinodchandran, Derandomizing Arthur-Merlin games using hitting sets, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999.","DOI":"10.1109\/SFFCS.1999.814579"},{"issue":"2","key":"10.1016\/S0022-0000(03)00046-1_BIB19","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\/S0022-0000(03)00046-1_BIB20","doi-asserted-by":"crossref","unstructured":"R. Shaltiel, C. Umans, Simple extractors for all min-entropies and a new pseudo-random generator, in: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 648\u2013657.","DOI":"10.1109\/SFCS.2001.959941"},{"key":"10.1016\/S0022-0000(03)00046-1_BIB21","doi-asserted-by":"crossref","DOI":"10.1006\/jcom.1997.0439","article-title":"Decoding of Reed Solomon codes beyond the error-correction bound","volume":"13","author":"Sudan","year":"1997","journal-title":"J. Complexity"},{"issue":"2","key":"10.1016\/S0022-0000(03)00046-1_BIB22","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1006\/jcss.2000.1730","article-title":"Pseudorandom generators without the XOR lemma","volume":"62","author":"Sudan","year":"2001","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(03)00046-1_BIB23","doi-asserted-by":"crossref","unstructured":"A. Ta-Shma, D. Zuckerman, S. Safra, Extractors from Reed\u2013Muller codes, in: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001.","DOI":"10.1109\/SFCS.2001.959940"},{"issue":"4","key":"10.1016\/S0022-0000(03)00046-1_BIB24","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1145\/502090.502099","article-title":"Extractors and pseudorandom generators","volume":"48","author":"Trevisan","year":"2001","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(03)00046-1_BIB25","unstructured":"R. Urbanke, Modern coding theory\u2014SS2001, Technical Report DSC-LTHC, EPFL, 2001, Available from http:\/\/lthcwww.epfl.ch\/content.php?title=coding2001."},{"key":"10.1016\/S0022-0000(03)00046-1_BIB26","doi-asserted-by":"crossref","unstructured":"A.C. Yao, Theory and applications of trapdoor functions (extended abstract), in: 23rd Annual Symposium on Foundations of Computer Science, Chicago, IL, 3\u20135 November, IEEE, New York, 1982, pp. 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000461?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000461?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,22]],"date-time":"2020-03-22T10:49:47Z","timestamp":1584874187000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0022000003000461"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00046-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}