{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T06:07:26Z","timestamp":1699423646852},"reference-count":8,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":[[1992,7]]},"DOI":"10.1016\/0020-0190(92)90225-k","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"295-298","source":"Crossref","is-referenced-by-count":2,"title":["Circuit depth relative to a random oracle"],"prefix":"10.1016","volume":"42","author":[{"given":"Peter Bro","family":"Miltersen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90225-K_BIB1","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle A, PA\u2260NPA\u2260co-NPA with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90225-K_BIB2","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","article-title":"Constant depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90225-K_BIB3","series-title":"Tech. Rept. SU-CIS-91-03","article-title":"Average dependence and random oracles","author":"Kurtz","year":"1991"},{"key":"10.1016\/0020-0190(92)90225-K_BIB4_1","series-title":"Proc. 5th Structure in Complexity Theory Conference","first-page":"268","article-title":"Circuit size relative to pseudorandom oracles","author":"Lutz","year":"1990"},{"key":"10.1016\/0020-0190(92)90225-K_BIB4_2","series-title":"Proc. 6th Structure in Complexity Theory Conference","first-page":"392","article-title":"Circuit size relative to pseudorandom oracles","author":"Lutz","year":"1991"},{"key":"10.1016\/0020-0190(92)90225-K_BIB5","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."},{"key":"10.1016\/0020-0190(92)90225-K_BIB6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01692056","article-title":"Relativized NC","volume":"20","author":"Wilson","year":"1987","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0020-0190(92)90225-K_BIB7","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1137\/0219024","article-title":"On the decomposability of NC and AC","volume":"19","author":"Wilson","year":"1990","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290225K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290225K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:57Z","timestamp":1555144077000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290225K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["002001909290225K"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90225-k","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}