{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:27:40Z","timestamp":1773228460119,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,4,1]],"date-time":"1982-04-01T00:00:00Z","timestamp":386467200000},"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":11430,"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":[[1982,4]]},"DOI":"10.1016\/0304-3975(82)90114-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"95-103","source":"Crossref","is-referenced-by-count":71,"title":["A uniform approach to obtain diagonal sets in complexity classes"],"prefix":"10.1016","volume":"18","author":[{"given":"Uwe","family":"Sch\u00f6ning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90114-1_BIB1","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978","journal-title":"Proc. 19th IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(82)90114-1_BIB2","first-page":"151","article-title":"Reducibility, randomness, and intractability","author":"Adleman","year":"1977","journal-title":"Proc. 9th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(82)90114-1_BIB3","first-page":"63","article-title":"Relationship between density and deterministic complexity of NP-complete languages,","volume":"62","author":"Berman","year":"1978"},{"key":"10.1016\/0304-3975(82)90114-1_BIB4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0022-0000(81)90021-0","article-title":"A note on structure and looking back applied to the relative complexity of computable functions","volume":"22","author":"Chew","year":"1981","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(82)90114-1_BIB5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/800157.805047","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971","journal-title":"Proc. 3rd Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(82)90114-1_BIB6","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"issue":"1","key":"10.1016\/0304-3975(82)90114-1_BIB7","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. ACM"},{"key":"10.1016\/0304-3975(82)90114-1_BIB8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(81)90069-4","article-title":"On the structure of sets in NP and other complexity classes","volume":"15","author":"Landweber","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90114-1_BIB9","doi-asserted-by":"crossref","unstructured":"T.J. Long, Strong nondeterministic polynomial-time reducibilities, Teor. Comput. Sci., to appear.","DOI":"10.1016\/0304-3975(82)90085-8"},{"key":"10.1016\/0304-3975(82)90114-1_BIB10","series-title":"Technical Memo 126","article-title":"With what frequency are apparently intractable problems difficult?","author":"Meyer","year":"1979"},{"key":"10.1016\/0304-3975(82)90114-1_BIB11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01744288","article-title":"P-selective sets, tally languages and the behaviour of polynomial time reducibilities on NP","volume":"13","author":"Selman","year":"1979","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(82)90114-1_BIB12","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."},{"key":"10.1016\/0304-3975(82)90114-1_BIB13","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":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582901141?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582901141?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:26:13Z","timestamp":1555125973000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582901141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,4]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,4]]}},"alternative-id":["0304397582901141"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90114-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,4]]}}}