{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T00:08:50Z","timestamp":1775779730254,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":6864,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR8612563"],"award-info":[{"award-number":["CCR8612563"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003973","name":"Israel Academy of Sciences and Humanities","doi-asserted-by":"publisher","award":["328071"],"award-info":[{"award-number":["328071"]}],"id":[{"id":"10.13039\/501100003973","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/s0022-0000(05)80043-1","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"149-167","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":518,"title":["Hardness vs randomness"],"prefix":"10.1016","volume":"49","author":[{"given":"Noam","family":"Nisan","sequence":"first","affiliation":[]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80043-1_bib1","series-title":"26th FOCS","first-page":"11","article-title":"Deterministic simulation of Probabilistic constant depth circuits","author":"Ajtai","year":"1985"},{"key":"10.1016\/S0022-0000(05)80043-1_bib2","series-title":"17th STOC","first-page":"421","article-title":"Trading group theory for randomness","author":"Babai","year":"1975"},{"key":"10.1016\/S0022-0000(05)80043-1_bib3","article-title":"Relative to a random oracle A, PA\u2260NPA\u2260Co \u2212 NAA with probability 1","volume":"10","author":"Bennet","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80043-1_bib4","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","article-title":"Arthur Merlin games: A randomized proof system, and a hierarchy of complexity classes","volume":"36","author":"Babai","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80043-1_bib5","series-title":"Proceedings, Structures in Complexity Theory","article-title":"BPP has weak subesponential simulations unless EXPTIME has publishable proofs","author":"Babai","year":"1991"},{"key":"10.1016\/S0022-0000(05)80043-1_bib6","first-page":"1","article-title":"Pseudorandom generators and complexity classes","volume":"Vol. 5","author":"Boppana","year":"1989"},{"key":"10.1016\/S0022-0000(05)80043-1_bib7","series-title":"3rd FOCS","first-page":"112","article-title":"How to generate cryptographically strong sequences of pseudo random bits","author":"Blum","year":"1982"},{"key":"10.1016\/S0022-0000(05)80043-1_bib8","series-title":"21 st STOC","first-page":"1","article-title":"Multiparty protocols and logspace hard pseudorandom sequences","author":"Babai","year":"1989"},{"key":"10.1016\/S0022-0000(05)80043-1_bib9","doi-asserted-by":"crossref","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80043-1_bib10","doi-asserted-by":"crossref","DOI":"10.1016\/S0019-9958(85)80043-7","article-title":"Pseudo random number generation and space complexity","volume":"64","author":"Furst","year":"1985","journal-title":"Inform. and Control"},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80043-1_bib11","doi-asserted-by":"crossref","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\/S0022-0000(05)80043-1_bib12","series-title":"18th STOC","first-page":"59","article-title":"Private coins vs public coins in interactive proof systems","author":"Goldwasser","year":"1986"},{"key":"10.1016\/S0022-0000(05)80043-1_bib13","article-title":"Computational Limitations for Small Depth Circuits","author":"Hastad","year":"1986"},{"key":"10.1016\/S0022-0000(05)80043-1_bib14","series-title":"16th FOCS","article-title":"On time versus space and related problems","author":"Hopcroft","year":"1975"},{"key":"10.1016\/S0022-0000(05)80043-1_bib15","series-title":"21st STOC","article-title":"Pseudorandom generators from any one-way function","author":"Imagliazzo","year":"1989"},{"key":"10.1016\/S0022-0000(05)80043-1_bib16","first-page":"191","article-title":"Turing machines that thake advice","volume":"28","author":"Karp","year":"1982","journal-title":"Enseign. Math."},{"key":"10.1016\/S0022-0000(05)80043-1_bib17","series-title":"24th FOCS","first-page":"56","article-title":"Monte-Carlo algorithms for enumeration and reliability problems","author":"Karp","year":"1983"},{"issue":"No. 5","key":"10.1016\/S0022-0000(05)80043-1_bib18","doi-asserted-by":"crossref","DOI":"10.1137\/0216056","article-title":"A note on randomized polynomial time","volume":"16","author":"Kurtz","year":"1987","journal-title":"SIAM J. Comput."},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80043-1_bib19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01375474","article-title":"Pseudo random bits for constant depth circuits","volume":"11","author":"Nisan","year":"1991","journal-title":"Combinatorica"},{"key":"10.1016\/S0022-0000(05)80043-1_bib20","series-title":"Towards a Theory of Parallel Randomized Computation","author":"Reif","year":"1984"},{"key":"10.1016\/S0022-0000(05)80043-1_bib21","series-title":"15th STOC","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983"},{"key":"10.1016\/S0022-0000(05)80043-1_bib22","first-page":"325","article-title":"Expanders, Randomness, or Time vs Space","author":"Sipser","year":"1986"},{"key":"10.1016\/S0022-0000(05)80043-1_bib23","first-page":"544","article-title":"On the generation of cryptographically strong pseudo-random sequences","volume":"Vol. 62","author":"Shamir","year":"1981"},{"issue":"No.1","key":"10.1016\/S0022-0000(05)80043-1_bib24","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial time hierarchy","volume":"3","author":"Stockmeyer","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80043-1_bib25","series-title":"23rd FOCS","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:S0022000005800431?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800431?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T05:43:40Z","timestamp":1668577420000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["S0022000005800431"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80043-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hardness vs randomness","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0022-0000(05)80043-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1994 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}