{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T11:27:49Z","timestamp":1648553269893},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"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":6894,"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":[[1994,9]]},"DOI":"10.1016\/0304-3975(94)90234-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"229-241","source":"Crossref","is-referenced-by-count":2,"title":["Minimal pairs and complete problems"],"prefix":"10.1016","volume":"132","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Homer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert I.","family":"Soare","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90234-8_bib1","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1137\/0215067","article-title":"An inhomogeneity in the polynomial time degrees","volume":"15","author":"Ambos-Spies","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90234-8_bib2","series-title":"Computation Theory and Logic","first-page":"1","article-title":"Minimal pairs for polynomial time reducibilities","volume":"Vol. 270","author":"Ambos-Spies","year":"1987"},{"key":"10.1016\/0304-3975(94)90234-8_bib3","series-title":"Trends in Theoretical Computer Science","article-title":"Polynomial time degrees of NP sets","author":"Ambos-Spies","year":"1987"},{"key":"10.1016\/0304-3975(94)90234-8_bib4","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\/0304-3975(94)90234-8_bib5","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(94)90234-8_bib6","unstructured":"R. Downey, Nondiamond theorems for polynomial time reducibility, to appear."},{"key":"10.1016\/0304-3975(94)90234-8_bib7","series-title":"Thesis","article-title":"Relativized polynomial hierarchy extending two levels","author":"Heller","year":"1980"},{"key":"10.1016\/0304-3975(94)90234-8_bib8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(83)90003-8","article-title":"Oracle dependent properties of the lattice of NP sets","volume":"24","author":"Homer","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90234-8_bib9","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(94)90234-8_bib10","first-page":"73","article-title":"On the structure of sets in NP and other complexity classes","volume":"2","author":"Landweber","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90234-8_bib11","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(94)90234-8_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":"19","author":"Sch\u00f6ning","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90234-8_bib13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0304-3975(84)90124-5","article-title":"Minimal pairs for P","volume":"31","author":"Sch\u00f6ning","year":"1984","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902348?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902348?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:59:02Z","timestamp":1555077542000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594902348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0304397594902348"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90234-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}