{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:44:30Z","timestamp":1649065470239},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"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":[[1996,5]]},"DOI":"10.1016\/0304-3975(95)00161-1","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"227-258","source":"Crossref","is-referenced-by-count":8,"title":["A general method to construct oracles realizing given relationships between complexity classes"],"prefix":"10.1016","volume":"157","author":[{"given":"Andrei A.","family":"Muchnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolai K.","family":"Vereshchagin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0304-3975(95)00161-1_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativization of P=?NP question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00161-1_BIB2","series-title":"Proc. 28th Ann. IEEE Symp. on Foundation of Comput. Sci.","first-page":"118","article-title":"General oracle and oracle classes","author":"Blum","year":"1987"},{"key":"10.1016\/0304-3975(95)00161-1_BIB3","series-title":"Proc. 8th Ann. Conf. on Structure in Complexity Theory","first-page":"120","article-title":"An oracle builder's toolkit","author":"Fenner","year":"1993"},{"key":"10.1016\/0304-3975(95)00161-1_BIB4","series-title":"Separability and one-way functions","author":"Fortnow","year":"1994"},{"key":"10.1016\/0304-3975(95)00161-1_BIB5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/0217018","article-title":"Complexity measures for public-key cryptosystems","volume":"17","author":"Grollman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00161-1_BIB6","series-title":"International Colloquium on Automata, Languages and Programming","article-title":"On complete problems for NP \u2229 Co-NP","volume":"Vol. 194","author":"Hartmanis","year":"1985"},{"key":"10.1016\/0304-3975(95)00161-1_BIB7_1","unstructured":"J. Hastad, Almost optimal lower bounds for small depth circuits, in: S. Micali, ed., Advances in Computer Research, 1989, Vol. 5: Randomness and Computation (JAI Press, Greenwich, CT)."},{"key":"10.1016\/0304-3975(95)00161-1_BIB7_2","series-title":"Computational Limitations for Small Depth Circuits","author":"Hastad","year":"1986"},{"key":"10.1016\/0304-3975(95)00161-1_BIB8","series-title":"Proc. 3rd Conf. on Structure in Complexity Theory","first-page":"29","article-title":"Decision trees and downward closures","author":"Impagliazzo","year":"1988"},{"key":"10.1016\/0304-3975(95)00161-1_BIB9","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1137\/0218027","article-title":"Relativized polynomial-time hierarchies having exactly k levels","volume":"18","author":"Ko","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00161-1_BIB10","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(83)90044-3","article-title":"BPP and the polynomial hierarchy","volume":"17","author":"Lautemann","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(95)00161-1_BIB11","author":"Muchnik","year":"1994"},{"key":"10.1016\/0304-3975(95)00161-1_BIB12","series-title":"Proc. 21th Ann. ACM Symp. on Theory of Computing","first-page":"327","article-title":"Probabilistic versus deterministic decision trees and CREW PRAM complexity","author":"Nisan","year":"1989"},{"key":"10.1016\/0304-3975(95)00161-1_BIB13_1","series-title":"Proc. 10th Ann. ACM Symp. on Theory of Computing","first-page":"338","article-title":"Relativized Questions Involving Probabilistic Algorithms","author":"Rackoff","year":"1978"},{"key":"10.1016\/0304-3975(95)00161-1_BIB13_2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/322290.322306","volume":"29","author":"Rackoff","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00161-1_BIB14","series-title":"Internat. Colloq. on Automata, Languages and Programming","first-page":"523","article-title":"On relativizations and the existence of complete sets","volume":"Vol. 140","author":"Sipser","year":"1982"},{"key":"10.1016\/0304-3975(95)00161-1_BIB15","series-title":"Proc. 15th Annual ACM Symp. on Theory of Computing","first-page":"330","article-title":"A complexity theoretic approach for randomness","author":"Sipser","year":"1983"},{"key":"10.1016\/0304-3975(95)00161-1_BIB16","series-title":"Proc. 26th Ann. IEEE Symp. on Foundations of Comput. Sci.","first-page":"1","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001611?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001611?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:52:58Z","timestamp":1555404778000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0304397595001611"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00161-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}