{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:34Z","timestamp":1759639054921},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"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":8202,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,2]]},"DOI":"10.1016\/0890-5401(91)90002-j","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"156-177","source":"Crossref","is-referenced-by-count":12,"title":["Separating the low and high hierachies by oracles"],"prefix":"10.1016","volume":"90","author":[{"given":"Ker-I","family":"Ko","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90002-J_BIB1","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\/0890-5401(91)90002-J_BIB2","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1145\/5925.5937","article-title":"The polynomial-time hierarchy and sparse oracles","volume":"33","author":"Balc\u00e1zar","year":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90002-J_BIB3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphisms and density of NP and other complete sets","volume":"1","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90002-J_BIB4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits, and the polynomial time hierarchy","volume":"17","author":"Furst","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0890-5401(91)90002-J_BIB5","series-title":"Proceedings, 18th ACM Symposium on Theory of Computing","first-page":"59","article-title":"Private coins versus public coins in interactive proof systems","author":"Goldwasser","year":"1986"},{"key":"10.1016\/0890-5401(91)90002-J_BIB6","article-title":"Computational Limitations for Small-Depth Circuits","author":"Hastad","year":"1987"},{"key":"10.1016\/0890-5401(91)90002-J_BIB7","series-title":"Proceedings, 18th ACM Symposium on Theory of Computing","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/0890-5401(91)90002-J_BIB8","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\/0890-5401(91)90002-J_BIB9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/0214003","article-title":"On circuit-size complexity and the low hierarchy in NP","volume":"14","author":"Ko","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90002-J_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(82)90085-8","article-title":"Strong nondeterministic polynomial-time reducibilities","volume":"21","author":"Long","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90002-J_BIB11","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. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90002-J_BIB12","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0022-0000(83)90027-2","article-title":"A low and a high hierarchy within NP","volume":"27","author":"Sch\u00f6ning","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(91)90002-J_BIB13","series-title":"Proceedings, 1987 Symposium on Theoretical Aspects of Computer Science","first-page":"114","article-title":"Graph isomorphism is in the low hierarchy","volume":"Vol. 247","author":"Sch\u00f6ning","year":"1987"},{"key":"10.1016\/0890-5401(91)90002-J_BIB14","series-title":"Proceedings, 15th ACM Symposium on Theory of Computing","first-page":"61","article-title":"Borel sets and circuit complexity","author":"Sipser","year":"1983"},{"key":"10.1016\/0890-5401(91)90002-J_BIB15","series-title":"Proceedings, 26th IEEE Symposium on Foundations of Computer Science","first-page":"1","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190002J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190002J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:25:49Z","timestamp":1548879949000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190002J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["089054019190002J"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90002-j","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,2]]}}}