{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:00:59Z","timestamp":1648720859758},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":8264,"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":[[1990,12]]},"DOI":"10.1016\/0022-0000(90)90023-e","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"307-320","source":"Crossref","is-referenced-by-count":11,"title":["Pseudorandom sources for BPP"],"prefix":"10.1016","volume":"41","author":[{"given":"Jack H.","family":"Lutz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90023-E_BIB1","series-title":"Proceedings, 19th ACM Symposium on Theory of Computing","first-page":"151","article-title":"Some consequences of the existence of pseudorandom generators","author":"Allender","year":"1987"},{"key":"10.1016\/0022-0000(90)90023-E_BIB2","series-title":"Proceedings, 19th ACM Symposium on Theory of Computing","first-page":"453","article-title":"Realistic analysis of some randomized algorithms","author":"Bach","year":"1987"},{"key":"10.1016\/0022-0000(90)90023-E_BIB3","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1214\/aoms\/1177705674","article-title":"On deviations of the sample mean","volume":"31","author":"Bahadur","year":"1960","journal-title":"Ann. of Math. Statist."},{"key":"10.1016\/0022-0000(90)90023-E_BIB4","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\/0022-0000(90)90023-E_BIB5","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. of Math. Statist."},{"key":"10.1016\/0022-0000(90)90023-E_BIB6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/BF01084088","article-title":"Families of recursive predicates of measure zero","volume":"6","author":"Freidzon","year":"1976","journal-title":"J. Soviet Math."},{"key":"10.1016\/0022-0000(90)90023-E_BIB7","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90023-E_BIB8","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","article-title":"How to construct random functions","volume":"33","author":"Goldreich","year":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90023-E_BIB9","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0304-3975(86)90081-2","article-title":"On the notion of infinite pseudorandom sequences","volume":"48","author":"Ko","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(90)90023-E_BIB10","series-title":"Proceedings, 17th ACM Symposium on Theory of Computing","first-page":"363","article-title":"One-way functions and pseudorandom generators","author":"Levin","year":"1985"},{"key":"10.1016\/0022-0000(90)90023-E_BIB11","series-title":"Proceedings, Second Structure in Complexity Theory Conference","first-page":"81","article-title":"Resource-bounded Baire category and small circuits in exponential space","author":"Lutz","year":"1987"},{"key":"10.1016\/0022-0000(90)90023-E_BIB12","article-title":"An Elementary Combinatorial Derivation of \u201cthe\u201d Chernoff Bound","author":"Lutz","year":"1988"},{"key":"10.1016\/0022-0000(90)90023-E_BIB18","doi-asserted-by":"crossref","unstructured":"[Lut90]J. H. Lutz, Category and measure in complexity classes, SIAM J. Comput., to appear.","DOI":"10.1137\/0219076"},{"key":"10.1016\/0022-0000(90)90023-E_BIB13","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","article-title":"On the definition of random sequences","volume":"9","author":"Martin-L\u00f6f","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(90)90023-E_BIB14","series-title":"Proceedings, Second Colloquium on Automata, Languages, and Programming","first-page":"317","article-title":"The \u201calmost all\u201d theory of subrecursive degrees is decidable","volume":"Vol. 14","author":"Mehlhorn","year":"1974"},{"key":"10.1016\/0022-0000(90)90023-E_BIB15","series-title":"Proceedings, 25th IEEE Symposium on Foundations of Computer Science","first-page":"434","article-title":"Generating quasi-random sequences from slightly random sources","author":"Santha","year":"1984"},{"key":"10.1016\/0022-0000(90)90023-E_BIB16","series-title":"Proceedings, 26th IEEE Symposium on Foundations of Computer Science","first-page":"417","article-title":"Random polynomial time is equal to slightly-random polynomial time","author":"Vazirani","year":"1985"},{"key":"10.1016\/0022-0000(90)90023-E_BIB17","series-title":"Proceedings, 23rd IEEE Symposium on Foundations of Computer Science","first-page":"80","article-title":"Theory and applications of trapdoor functions","author":"Yao","year":"1982"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090023E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090023E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:56:05Z","timestamp":1550307365000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090023E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["002200009090023E"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90023-e","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}