{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T11:39:36Z","timestamp":1705059576358},"reference-count":47,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":7502,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,1]]},"DOI":"10.1016\/0304-3975(93)90256-s","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:31:49Z","timestamp":1027654309000},"page":"95-120","source":"Crossref","is-referenced-by-count":18,"title":["Circuit size relative to pseudorandom oracles"],"prefix":"10.1016","volume":"107","author":[{"given":"Jack H.","family":"Lutz","sequence":"first","affiliation":[]},{"given":"William J.","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90256-S_BIB1","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1137\/0217075","article-title":"P-printable sets","volume":"17","author":"Allender","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90256-S_BIB2","series-title":"Proc. 1st Structure in Complexity Theory Conf.","first-page":"23","article-title":"Randomness, relativizations, and polynomial reducibilities","author":"Ambos-Spies","year":"1986"},{"key":"10.1016\/0304-3975(93)90256-S_BIB3","series-title":"Proc. 17th Ann. ACM Symp. on Theory of Computing","first-page":"421","article-title":"Trading group theory for randomness","author":"Babai","year":"1985"},{"key":"10.1016\/0304-3975(93)90256-S_BIB4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(87)90036-6","article-title":"Random oracles separate PSPACE from the polynomial-time hierarchy","volume":"26","author":"Babai","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(93)90256-S_BIB5","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativizations of the P = ?NP question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90256-S_BIB6","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\/0304-3975(93)90256-S_BIB7","series-title":"Structural Complexity I","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/0304-3975(93)90256-S_BIB8","series-title":"Proc. 4th Ann. Structure in Complexity Theory Conf.","first-page":"216","article-title":"On the relativized power of additional accepting paths","author":"Beigel","year":"1989"},{"key":"10.1016\/0304-3975(93)90256-S_BIB9","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle A, PA \u2260 NPA \u2260 co-NPA with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90256-S_BIB10","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphism and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90256-S_BIB11","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1137\/0220015","article-title":"Some observations on separating complexity classes","volume":"20","author":"Book","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90256-S_BIB12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02090773","article-title":"Characterizing polynomial complexity classes by reducibilities","volume":"23","author":"Book","year":"1990","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(93)90256-S_BIB13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF03019651","article-title":"Sur les probabilit\u00e9s d\u00e9nombrales et leurs applications arithm\u00e9tique","volume":"27","author":"Borel","year":"1909","journal-title":"Rend. Circ. Mat. Palermo"},{"key":"10.1016\/0304-3975(93)90256-S_BIB14","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\/0304-3975(93)90256-S_BIB15","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF03018295","article-title":"La tendenza ad un limite nel senzo del calcolo delle probabilita","volume":"41","author":"Cantelli","year":"1916","journal-title":"Rend. Circ. Mat. Palermo"},{"key":"10.1016\/0304-3975(93)90256-S_BIB16","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\/0304-3975(93)90256-S_BIB17","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90256-S_BIB18","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. Math. Stat."},{"key":"10.1016\/0304-3975(93)90256-S_BIB19","series-title":"Proc. 24th IEEE Symp. on the 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\/0304-3975(93)90256-S_BIB20","series-title":"Proc. 1st Structure in Complexity Theory Conf.","first-page":"184","article-title":"Resource-bounded Kolmogorov complexity of hard languages","author":"Huynh","year":"1986"},{"key":"10.1016\/0304-3975(93)90256-S_BIB21","series-title":"Proc. 12th ACM Symp. on Theory of Computing","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/0304-3975(93)90256-S_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\/0304-3975(93)90256-S_BIB23","first-page":"1","article-title":"Three approaches to the quantitative definition of \u201cinfomation\u201d","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0304-3975(93)90256-S_BIB24","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1137\/1132060","article-title":"Algorithms and randomness","volume":"32","author":"Kolmogorov","year":"1987","journal-title":"Theory Probab. Appl."},{"key":"10.1016\/0304-3975(93)90256-S_BIB25","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0019-9958(83)80023-0","article-title":"On the random oracle hypothesis","volume":"57","author":"Kurtz","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90256-S_BIB26","series-title":"Proc. 21st ACM Symp. on Theory of Computing","first-page":"157","article-title":"The isomorphism conjecture fails relative to a random oracle","author":"Kurtz","year":"1989"},{"key":"10.1016\/0304-3975(93)90256-S_BIB27","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0019-9958(84)80060-1","article-title":"Randomness conservation inequalities; information and independence in mathematical theories","volume":"61","author":"Levin","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90256-S_BIB28","series-title":"Handbook of Theoretical Computer Science, Vol. A","first-page":"187","article-title":"Kolmogorov complexity and its applications","author":"Li","year":"1990"},{"key":"10.1016\/0304-3975(93)90256-S_BIB29","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1145\/5925.5938","article-title":"Relativizing complexity classes with sparse oracles","volume":"33","author":"Long","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90256-S_BIB30","series-title":"Ph.D. Thesis","article-title":"Resource bounded Kolmogorov complexity, a link between computational complexity and information theory","author":"Longpr\u00e9","year":"1986"},{"key":"10.1016\/0304-3975(93)90256-S_BIB31","first-page":"23","article-title":"On the synthesis of contact networks","volume":"119","author":"Lupanov","year":"1958","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0304-3975(93)90256-S_BIB32","series-title":"Proc. 4th Structure in Complexity Theory Conf.","first-page":"37","article-title":"Almost everywhere high nonuniform complexity","author":"Lutz","year":"1989"},{"key":"10.1016\/0304-3975(93)90256-S_BIB33","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1137\/0219076","article-title":"Category and measure in complexity classes","volume":"19","author":"Lutz","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90256-S_BIB34","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(90)90023-E","article-title":"Pseudorandom sources for BPP","volume":"41","author":"Lutz","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90256-S_BIB35","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","article-title":"Almost everywhere high nonuniform complexity","volume":"44","author":"Lutz","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90256-S_BIB36","doi-asserted-by":"crossref","unstructured":"J.H. Lutz, A pseudorandom oracle characterization of BPP, SIAM J. Comput., to appear.","DOI":"10.1109\/SCT.1991.160261"},{"key":"10.1016\/0304-3975(93)90256-S_BIB37","unstructured":"J.H. Lutz, Resource-bounded measure, in preparation."},{"key":"10.1016\/0304-3975(93)90256-S_BIB38","unstructured":"J.H. Lutz, Intrinsically pseudorandom sequences, in preparation."},{"key":"10.1016\/0304-3975(93)90256-S_BIB39","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\/0304-3975(93)90256-S_BIB40","series-title":"Proc. 29th IEEE Symp. on Foundations of Computer Science","first-page":"2","article-title":"Hardness vs. randomness","author":"Nisan","year":"1988"},{"key":"10.1016\/0304-3975(93)90256-S_BIB41","series-title":"Complexity and Structure","author":"Sch\u00f6ning","year":"1986"},{"key":"10.1016\/0304-3975(93)90256-S_BIB42","series-title":"Proc. 31st Ann. Symp. on Foundations of Computer Science","first-page":"11","article-title":"IP = PSPACE","author":"Shamir","year":"1990"},{"key":"10.1016\/0304-3975(93)90256-S_BIB43","series-title":"Proc. 15th ACM Symp. on Theory of Computing","first-page":"330","article-title":"A complexity-theoretic approach to randomness","author":"Sipser","year":"1983"},{"key":"10.1016\/0304-3975(93)90256-S_BIB44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","article-title":"A formal theory of inductive inference","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90256-S_BIB45","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1137\/0218031","article-title":"On tally relativization of BP-complexity classes","volume":"18","author":"Tang","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90256-S_BIB46","series-title":"Tech. Report TR-140","article-title":"Relativization, reducibilities, and the exponential hierarchy","author":"Wilson","year":"1980"},{"key":"10.1016\/0304-3975(93)90256-S_BIB47","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0022-0000(85)90040-6","article-title":"Relativized circuit complexity","volume":"31","author":"Wilson","year":"1985","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390256S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390256S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:51:43Z","timestamp":1555156303000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390256S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["030439759390256S"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90256-s","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}