{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:17:41Z","timestamp":1778296661138,"version":"3.51.4"},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"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":10943,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1983,8]]},"DOI":"10.1016\/0022-0000(83)90027-2","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"14-28","source":"Crossref","is-referenced-by-count":132,"title":["A low and a high hierarchy within NP"],"prefix":"10.1016","volume":"27","author":[{"given":"Uwe","family":"Sch\u00f6ning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90027-2_BIB1","series-title":"Proceedings, 19th Symposium on Foundations of Computer Science","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978"},{"key":"10.1016\/0022-0000(83)90027-2_BIB2","series-title":"Proceedings, 9th Symposium on Theory of Computing","first-page":"151","article-title":"Reducibility, randomness, and intractability","author":"Adleman","year":"1977"},{"key":"10.1016\/0022-0000(83)90027-2_BIB3","series-title":"Proceedings, 20th Symposium on Foundations of Computer Science","first-page":"397","article-title":"Reductions that lie","author":"Adleman","year":"1979"},{"key":"10.1016\/0022-0000(83)90027-2_BIB4","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(83)90027-2_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\/0022-0000(83)90027-2_BIB6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(79)90043-4","article-title":"A second step toward the polynomial hierarchy","volume":"8","author":"Baker","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(83)90027-2_BIB7","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\/0022-0000(83)90027-2_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01768464","article-title":"Inclusion complete tally languages and the Hartmanis-Berman conjecture","volume":"11","author":"Book","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(83)90027-2_BIB9","article-title":"Some Comments on Functional Self-Reducibility and the NPHierarchy","author":"Borodin","year":"1976"},{"key":"10.1016\/0022-0000(83)90027-2_BIB10","article-title":"A Note on Cryptography and NP \u22d21 coNP-P","author":"Brassard","year":"1978"},{"key":"10.1016\/0022-0000(83)90027-2_BIB11","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0067135","article-title":"Degrees of Unsolvability: Structure and Theory","author":"Epstein","year":"1979"},{"key":"10.1016\/0022-0000(83)90027-2_BIB12","series-title":"5th Conference on Theoretical Computer Science","first-page":"123","article-title":"Recent directions in algorithmic research","author":"Hopcroft","year":"1981"},{"key":"10.1016\/0022-0000(83)90027-2_BIB13","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(83)90027-2_BIB14","series-title":"Proceedings, 12th 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\/0022-0000(83)90027-2_BIB15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90027-2_BIB16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"A comparison of polynomial time reducibllitles","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(83)90027-2_BIB17","series-title":"Elements of the Theory of Computation","author":"Lewis","year":"1981"},{"key":"10.1016\/0022-0000(83)90027-2_BIB18","article-title":"On Some Polynomial Time Reducibilities","author":"Long","year":"1978"},{"key":"10.1016\/0022-0000(83)90027-2_BIB19","series-title":"Proceedings, 11th Symposium on Theory of Computing","first-page":"278","article-title":"On \u03b3-reducibility versus polynomial time many-one reducibility","author":"Long","year":"1979"},{"key":"10.1016\/0022-0000(83)90027-2_BIB20","series-title":"Recursion Theory: Its Generalisations and Applications","first-page":"52","article-title":"A Survey of non-r.e. degrees \\\u030c0\u2032","author":"Posner","year":"1980"},{"key":"10.1016\/0022-0000(83)90027-2_BIB21","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0022-0000(83)90027-2_BIB22","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/0203021","article-title":"Computationally related problems","volume":"3","author":"Sahni","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90027-2_BIB23","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/0207035","article-title":"Polynomial time enumeration reducibility","volume":"7","author":"Selman","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90027-2_BIB24","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/1008883.1008885","article-title":"A note on complete sets for the polynomial time hierarchy","volume":"13","author":"Sch\u00f6ning","year":"1981","journal-title":"SIGACT News"},{"key":"10.1016\/0022-0000(83)90027-2_BIB25","article-title":"Untersuchungen zur Struktur von NP and verwandten Komplexit\u00e4tsklassen mit Hilfe verschiedener polynomieller Reduktionen","author":"Sch\u00f6ning","year":"1981"},{"key":"10.1016\/0022-0000(83)90027-2_BIB26","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(82)90114-1","article-title":"A uniform approach to obtain diagonal sets in complexity classes","volume":"18","author":"Sch\u00f6ning","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(83)90027-2_BIB27","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1090\/S0002-9904-1978-14552-2","article-title":"Recursively enumerable sets and degrees","volume":"84","author":"Soare","year":"1978","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0022-0000(83)90027-2_BIB28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/0022-0000(83)90027-2_BIB29","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","article-title":"Relative complexity of checking and evaluating","volume":"5","author":"Valiant","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(83)90027-2_BIB30","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial-time hierarchy","volume":"3","author":"Wrathall","year":"1977","journal-title":"Theoret. Comput. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900272?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900272?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:51:02Z","timestamp":1550325062000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["0022000083900272"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90027-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}