{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,16]],"date-time":"2023-04-16T14:32:37Z","timestamp":1681655557366},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":7868,"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":[[1992,1]]},"DOI":"10.1016\/0304-3975(92)90317-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"301-307","source":"Crossref","is-referenced-by-count":5,"title":["On independent random oracles"],"prefix":"10.1016","volume":"92","author":[{"given":"Jack H.","family":"Lutz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90317-9_BIB1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/3-540-16486-3_87","article-title":"Randomness, relativizations, and polynomial reducibilities","author":"Ambos-Spies","year":"1986","journal-title":"Proc. First Structure in Complexity Theory Conference"},{"key":"10.1016\/0304-3975(92)90317-9_BIB2","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(92)90317-9_BIB3","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":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(92)90317-9_BIB4","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0196-8858(87)90010-8","article-title":"Incompleteness theorems for random reals","volume":"8","author":"Chaitin","year":"1987","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/0304-3975(92)90317-9_BIB5","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\/0304-3975(92)90317-9_BIB6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-49888-6","author":"Kolmogorov","year":"1933","journal-title":"Grundbegriffe der Wahrscheinlichkeitsrechnung"},{"key":"10.1016\/0304-3975(92)90317-9_BIB7","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1137\/0216056","article-title":"A note on randomized polynomial time","volume":"16","author":"Kurtz","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90317-9_BIB8","first-page":"1413","article-title":"On the notion of a random sequence","volume":"14","author":"Levin","year":"1973","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(92)90317-9_BIB9_1","doi-asserted-by":"crossref","unstructured":"J.H. Lutz, Almost everywhere high nonuniform complexity, J. Comput. System. Sci., to appear;","DOI":"10.1109\/SCT.1989.41813"},{"key":"10.1016\/0304-3975(92)90317-9_BIB9_2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/SCT.1989.41813","author":"Lutz","year":"1989","journal-title":"Proc. Fourth Structure in Complexity Theory Conference"},{"key":"10.1016\/0304-3975(92)90317-9_BIB10","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(92)90317-9_BIB11","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(92)90317-9_BIB12_1","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(92)90317-9_BIB12_2","author":"Lutz","year":"1991","journal-title":"Proc. Sixth Structure in Complexity Theory Conference"},{"key":"10.1016\/0304-3975(92)90317-9_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\/0304-3975(92)90317-9_BIB14","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/SFCS.1988.21916","article-title":"Hardness vs. randomness","author":"Nissan","year":"1988","journal-title":"Proc. 29th IEEE Symp. Foundations of Computer Science"},{"key":"10.1016\/0304-3975(92)90317-9_BIB15","series-title":"Measure and Category","author":"Oxtoby","year":"1980"},{"key":"10.1016\/0304-3975(92)90317-9_BIB16","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","article-title":"Process complexity and effective random tests","volume":"7","author":"Schnorr","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90317-9_BIB17","first-page":"316","article-title":"On relations between different algorithmic definitions of randomness","volume":"38","author":"Shen'","year":"1989","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(92)90317-9_BIB18","first-page":"119","article-title":"Incompleteness theorems for random reals","volume":"8","author":"Solovay","year":"1975","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/0304-3975(92)90317-9_BIB19","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(91)90314-R","article-title":"Polynomial-time reducibilities and \u201calmost-all\u201d oracle sets","author":"Tang","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90317-9_BIB20","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1137\/0218031","article-title":"On tally relativizations of BP-complexity classes","volume":"18","author":"Tang","year":"1989","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592903179?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592903179?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T14:18:40Z","timestamp":1580912320000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592903179"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["0304397592903179"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90317-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}