{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T13:07:00Z","timestamp":1744808820590},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1016\/s0020-0190(97)00054-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"165-170","source":"Crossref","is-referenced-by-count":4,"title":["Large sets in AC0 have many strings with low Kolmogorov complexity"],"prefix":"10.1016","volume":"62","author":[{"given":"Marius","family":"Zimand","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00054-9_BIB1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0022-0000(89)90021-4","article-title":"Some consequences of the existence of pseudorandom generators","volume":"39","author":"Allender","year":"1989","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/S0020-0190(97)00054-9_BIB2","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0022-0000(89)90033-0","article-title":"With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy","volume":"38","author":"Cai","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(97)00054-9_BIB3","series-title":"Proc. 24th IEEE Symp. on Foundations of Computer Science","first-page":"439","article-title":"Generalized Kolmogorov complexity and the structure of feasible computations","author":"Hartmanis","year":"1983"},{"key":"10.1016\/S0020-0190(97)00054-9_BIB4","article-title":"Lower bounds for the size of parity circuits","author":"H\u00e5stad","year":"1987"},{"key":"10.1016\/S0020-0190(97)00054-9_BIB5","series-title":"Proc. 12th Ann. Symp. on Theoretical Aspects of Computer Science","first-page":"50","article-title":"Pseudorandom generators and the frequency of simplicity","volume":"Vol. 900","author":"Han","year":"1995"},{"key":"10.1016\/S0020-0190(97)00054-9_BIB6","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1993"},{"issue":"1","key":"10.1016\/S0020-0190(97)00054-9_BIB7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01375474","article-title":"Pseudorandom bits for constant depth circuits","volume":"11","author":"Nisan","year":"1991","journal-title":"Combinatorica"},{"key":"10.1016\/S0020-0190(97)00054-9_BIB8","series-title":"Proc. 29th IEEE Symp. on Foundations of Computer Science","first-page":"2","article-title":"Hardness vs. randomness","author":"Nisan","year":"1988"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000549?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000549?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:25:44Z","timestamp":1556058344000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097000549"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0020019097000549"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00054-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}