{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T11:53:10Z","timestamp":1723117990071},"reference-count":39,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"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":8751,"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":[[1989,8]]},"DOI":"10.1016\/0022-0000(89)90021-4","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"101-124","source":"Crossref","is-referenced-by-count":19,"title":["Some consequences of the existence of pseudorandom generators"],"prefix":"10.1016","volume":"39","author":[{"given":"Eric W.","family":"Allender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90021-4_BIB1","article-title":"Time, space, and randomness","author":"Adleman","year":"1979","journal-title":"Technical Report MIT\/MCS\/TM 131"},{"key":"10.1016\/0022-0000(89)90021-4_BIB2","series-title":"Proceedings, 19th Annual ACM Symposium on Theory of Computing","first-page":"462","article-title":"Recognizing primes in random polynomial time","author":"Adleman","year":"1987"},{"key":"10.1016\/0022-0000(89)90021-4_BIB3","first-page":"1193","article-title":"P-printable sets","volume":"17","author":"Allender","year":"1988"},{"key":"10.1016\/0022-0000(89)90021-4_BIB4","series-title":"Proceedings, 19th Annual ACM Symposium on Theory of Computing","first-page":"151","article-title":"Some consequences of the existence of pseudorandom generators, preliminary version","author":"Allender","year":"1987"},{"key":"10.1016\/0022-0000(89)90021-4_BIB5","unstructured":"E. Allender, in preparation."},{"key":"10.1016\/0022-0000(89)90021-4_BIB6","series-title":"Proceedings, 26th IEEE Symposium on Foundations of Computer Science","first-page":"11","article-title":"Deterministic simulation of probabilistic constant depth circuits","author":"Ajtai","year":"1985"},{"key":"10.1016\/0022-0000(89)90021-4_BIB7","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/BF00264313","article-title":"Sets with small generalized Kolmogorov complexity","volume":"23","author":"Balc\u00e1zar","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(89)90021-4_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01699457","article-title":"Bi-immune sets for complexity classes","volume":"18","author":"Balc\u00e1zar","year":"1981","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(89)90021-4_BIB9","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle, P(A) \u2260 NP(A) \u2260 Co-NP(A) with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90021-4_BIB10","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphisms and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90021-4_BIB11","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\/0022-0000(89)90021-4_BIB12","article-title":"Pseudorandom generators and complexity classes","author":"Boppana","year":"1988"},{"key":"10.1016\/0022-0000(89)90021-4_BIB13","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/321356.321363","article-title":"On the length of programs for computing finite binary sequences","volume":"13","author":"Chaitin","year":"1966","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(89)90021-4_BIB14","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","article-title":"A theory of program size formally identical to information theory","volume":"22","author":"Chaitin","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(89)90021-4_BIB15","series-title":"Proceedings, 4th Annual Symposium on Theoretical Aspects of Computer Science","first-page":"125","article-title":"A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees","volume":"Vol. 247","author":"Geske","year":"1987"},{"key":"10.1016\/0022-0000(89)90021-4_BIB16","series-title":"Proceedings, 18th Annual ACM Symposium on Theory of Computing","first-page":"316","article-title":"Almost all primes can be quickly certified","author":"Goldwasser","year":"1986"},{"key":"10.1016\/0022-0000(89)90021-4_BIB17","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","article-title":"Probabilistic encryption","volume":"28","author":"Goldwasser","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(89)90021-4_BIB18","series-title":"Proceedings, 24th IEEE Symposium on Foundations of Computing","first-page":"439","article-title":"Generalized Kolmogorov complexity and the structure of feasible computations","author":"Hartmanis","year":"1983"},{"key":"10.1016\/0022-0000(89)90021-4_BIB19","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(84)90111-7","article-title":"Computation times of NP sets of different densities","volume":"34","author":"Hartmanis","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(89)90021-4_BIB20","series-title":"Can P and NP manufacture randomness?","author":"Hemachandra","year":"1986"},{"key":"10.1016\/0022-0000(89)90021-4_BIB21","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(89)90021-4_BIB22","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(89)90021-4_BIB23","series-title":"Proceedings, Structure in Complexity Theory Conference","first-page":"197","article-title":"What is a hard instance of a computational problem?","volume":"Vol. 223","author":"Ko","year":"1986"},{"key":"10.1016\/0022-0000(89)90021-4_BIB24","first-page":"1","article-title":"Three approaches to the quantitative definition of randomness","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0022-0000(89)90021-4_BIB25","first-page":"265","article-title":"Universal sequential search problems","volume":"9","author":"Levin","year":"1973","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0022-0000(89)90021-4_BIB26","first-page":"15","article-title":"Randomness conservation inequalities; Information and independence in mathematical theories","volume":"61","author":"Levin","year":"1984"},{"key":"10.1016\/0022-0000(89)90021-4_BIB27","series-title":"Proceedings, 17th Annual 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(89)90021-4_BIB28","series-title":"Proceedings, 18th Annual ACM Symposium on Theory of Computing","first-page":"177","article-title":"New lower bounds for parallel computation","author":"Li","year":"1986"},{"key":"10.1016\/0022-0000(89)90021-4_BIB29","article-title":"Resource Bounded Kolmogorov Complexity, a Link between Computational Complexity and Information Theory","author":"Longpr\u00e9","year":"1986"},{"key":"10.1016\/0022-0000(89)90021-4_BIB30","series-title":"Proceedings, 21st IEEE Symposium on Foundations of Computer Science","first-page":"86","article-title":"Succinct representations, random strings and complexity classes","author":"Peterson","year":"1980"},{"key":"10.1016\/0022-0000(89)90021-4_BIB31","series-title":"Proceedings, 20th Annual ACM Symposium on Theory of Computing","first-page":"504","article-title":"Two infinite sets of primes with fast primality tests","author":"Pintz","year":"1988"},{"key":"10.1016\/0022-0000(89)90021-4_BIB32","article-title":"Efficient Parallel Pseudo-random Number Generation","author":"Reif","year":"1984"},{"key":"10.1016\/0022-0000(89)90021-4_BIB33","article-title":"Complexity and Structure","volume":"Vol. 211","author":"Sch\u00f6ning","year":"1986"},{"key":"10.1016\/0022-0000(89)90021-4_BIB34","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/322047.322061","article-title":"Separating nondeterministic time complexity classes","volume":"25","author":"Seiferas","year":"1978","journal-title":"J. Assoc Comput. Mach."},{"key":"10.1016\/0022-0000(89)90021-4_BIB35","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/357353.357357","article-title":"On the generation of cryptographically strong pseudorandom sequences","volume":"1","author":"Shamir","year":"1977","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/0022-0000(89)90021-4_BIB36","series-title":"Proceedings 15th Annual ACM Symposium on Theory of Computing","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983"},{"key":"10.1016\/0022-0000(89)90021-4_BIB37","series-title":"Generalized Kolmogorov complexity of computations","author":"Watanabe","year":"1986"},{"key":"10.1016\/0022-0000(89)90021-4_BIB38","series-title":"Proceedings, 24th IEEE Symposium on Foundations of Computer Science","first-page":"335","article-title":"Randomness and the density of hard problems","author":"Wilber","year":"1983"},{"key":"10.1016\/0022-0000(89)90021-4_BIB39","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:0022000089900214?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900214?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:55:04Z","timestamp":1550325304000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["0022000089900214"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90021-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}