{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T12:29:59Z","timestamp":1648643399017},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":7137,"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,1]]},"DOI":"10.1016\/0304-3975(92)00077-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"315-327","source":"Crossref","is-referenced-by-count":2,"title":["On \u03a02 theories of hp-T degrees of low sets"],"prefix":"10.1016","volume":"123","author":[{"given":"Kunimasa","family":"Aoki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juichi","family":"Shinoda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teruko","family":"Tsuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)00077-5_BIB1","series-title":"Tech. Report 206 Abteilung Informatik","article-title":"On the structure of the polynomial time degrees of recursive sets","author":"Ambos-Spies","year":"1985"},{"key":"10.1016\/0304-3975(92)00077-5_BIB2","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/0022-0000(89)90023-8","article-title":"Honest polynomial time reducibilities and the P=?NP problem","volume":"39","author":"Ambos-Spies","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)00077-5_BIB3","first-page":"1","article-title":"Honest Polynomial-Time Degrees of Elementary Recursive Sets","volume":"Vol. 440","author":"Ambos-Spies","year":"1990"},{"key":"10.1016\/0304-3975(92)00077-5_BIB4","doi-asserted-by":"crossref","first-page":"505","DOI":"10.2969\/jmsj\/04430505","article-title":"Strong minimal pair theorem for the honest polynomial degrees of \u039402 low sets","volume":"44","author":"Aoki","year":"1992","journal-title":"J. Math. Soc. Japan"},{"key":"10.1016\/0304-3975(92)00077-5_BIB5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(91)90354-5","article-title":"On computational complexity and honest polynomial degrees","volume":"78","author":"Downey","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)00077-5_BIB6","first-page":"193","article-title":"Minimal Polynomial Degrees of Nonrecursive Sets","volume":"Vol. 1141","author":"Homer","year":"1984"},{"key":"10.1016\/0304-3975(92)00077-5_BIB7","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1145\/23005.23009","article-title":"Minimal degrees for polynomial reducibilities","volume":"34","author":"Homer","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(92)00077-5_BIB8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(87)90036-3","article-title":"Honest polynomial degrees and P=?NP","volume":"51","author":"Homer","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)00077-5_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. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(92)00077-5_BIB10","series-title":"Degrees of Unsolvability","author":"Lerman","year":"1983"},{"key":"10.1016\/0304-3975(92)00077-5_BIB11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(92)90078-T","article-title":"The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two quantifier theory","volume":"97","author":"Shore","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)00077-5_BIB12","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592000775?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592000775?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:03Z","timestamp":1555129563000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592000775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0304397592000775"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)00077-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}