{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:15:59Z","timestamp":1648998959831},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1976,6,1]],"date-time":"1976-06-01T00:00:00Z","timestamp":202435200000},"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":13560,"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":[[1976,6]]},"DOI":"10.1016\/0304-3975(76)90007-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"73-76","source":"Crossref","is-referenced-by-count":7,"title":["Minimal pairs of polynomial degrees with subexponential complexity"],"prefix":"10.1016","volume":"2","author":[{"given":"Michael","family":"Machtey","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90007-4_BIB1","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1145\/800125.804041","article-title":"Type two computational complexity","author":"Constable","year":"1973","journal-title":"Proc. Fifth ACM Symp. Theory Computing"},{"key":"10.1016\/0304-3975(76)90007-4_BIB2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/0304-3975(76)90007-4_BIB3","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(76)90007-4_BIB4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0019-9958(74)80039-2","article-title":"The honest subrecursive classes are a lattice","volume":"24","author":"Machtey","year":"1974","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(76)90007-4_BIB5","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/800119.803890","article-title":"Polynomial and abstract subrecursive classes","author":"Mehlhorn","year":"1974","journal-title":"Proc. Sixth ACM Symp. Theory Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900074?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900074?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:20:58Z","timestamp":1555125658000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900074"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,6]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,6]]}},"alternative-id":["0304397576900074"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90007-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976,6]]}}}