{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:38:20Z","timestamp":1757543900078},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"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":[[1984]]},"DOI":"10.1016\/0304-3975(84)90124-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"41-48","source":"Crossref","is-referenced-by-count":16,"title":["Minimal pairs for P"],"prefix":"10.1016","volume":"31","author":[{"given":"Uwe","family":"Sch\u00f6ning","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90124-5_BIB1","first-page":"151","article-title":"Reducibility, randomness, and intractability","author":"Adleman","year":"1977","journal-title":"Proc. 9th ACM Symp. Theory of Computing"},{"key":"10.1016\/0304-3975(84)90124-5_BIB2","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(74)90473-2","article-title":"Tally languages and complexity classes","volume":"26","author":"Book","year":"1974","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(84)90124-5_BIB3","series-title":"Ph.D. Dissertation","article-title":"The structure of complexity classes and degrees","author":"Breidbart","year":"1977"},{"key":"10.1016\/0304-3975(84)90124-5_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(84)90124-5_BIB5","unstructured":"K. Ko and U. Sch\u00f6ning, On circuit-size complexity and the low heirarchy in NP, SIAM J. Comput., to appear."},{"key":"10.1016\/0304-3975(84)90124-5_BIB6","doi-asserted-by":"crossref","first-page":"626","DOI":"10.2307\/2273300","article-title":"Bounding minimal pairs","volume":"44","author":"Lachlan","year":"1979","journal-title":"J. Symbolic Logic"},{"issue":"3","key":"10.1016\/0304-3975(84)90124-5_BIB7","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1112\/plms\/s3-16.1.537","article-title":"Lower bounds for pairs of r.e. degrees","volume":"16","author":"Lachlan","year":"1966","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/0304-3975(84)90124-5_BIB8","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\/0304-3975(84)90124-5_BIB9","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(84)90124-5_BIB10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(76)90007-4","article-title":"Minimal pairs of polynomial degrees with subexponential complexity","volume":"2","author":"Machtey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(84)90124-5_BIB11","series-title":"Dissertation","article-title":"Untersuchungen zur Struktur von NP und verwandten Komplexit\u00e4tsklassen mit Hilfe verschiedener polynomieller Reduktionen","author":"Sch\u00f6ning","year":"1981"},{"key":"10.1016\/0304-3975(84)90124-5_BIB12","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\/0304-3975(84)90124-5_BIB13","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\/0304-3975(84)90124-5_BIB14","series-title":"Recursively Enumerable Sets and Degrees: The Study of Computable Functions and Computably Generated Sets","author":"Soare","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584901245?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584901245?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T09:55:40Z","timestamp":1555062940000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397584901245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1984]]}},"alternative-id":["0304397584901245"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90124-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}