{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:44:38Z","timestamp":1648514678530},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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":5982,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0168-0072(96)00037-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T16:11:55Z","timestamp":1049731915000},"page":"97-117","source":"Crossref","is-referenced-by-count":0,"title":["Strong polynomial-time reducibility"],"prefix":"10.1016","volume":"84","author":[{"given":"Juichi","family":"Shinoda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0168-0072(96)00037-1_BIB1","series-title":"On the structure of the polynomial time degrees of recursive sets (Habilitationschrift)","author":"Ambos-Spies","year":"1984"},{"key":"10.1016\/S0168-0072(96)00037-1_BIB2","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/0022-0000(89)90023-8","article-title":"Honest polynomial time reducibilities and P = ?NP problem","volume":"39","author":"Ambos-Spies","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0168-0072(96)00037-1_BIB3","first-page":"209","article-title":"The theory of the polynomial many-one degrees of recursive sets is undecidable","volume":"Vol. 577","author":"Ambos-Spies","year":"1992"},{"key":"10.1016\/S0168-0072(96)00037-1_BIB4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0304-3975(92)00077-5","article-title":"On \u03a02 theories of hp-T degrees of low sets","volume":"123","author":"Aoki","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0168-0072(96)00037-1_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\/S0168-0072(96)00037-1_BIB6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0022-0000(92)90032-E","article-title":"Nondiamond theorems for polynomial time reducibility","volume":"45","author":"Downey","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0168-0072(96)00037-1_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\/S0168-0072(96)00037-1_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\/S0168-0072(96)00037-1_BIB9","series-title":"Degrees of Unsolvability, Perspectives in Mathematical Logic","author":"Lerman","year":"1983"},{"key":"10.1016\/S0168-0072(96)00037-1_BIB10","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","article-title":"Riemann's hypothesis and tests of primality","volume":"13","author":"Miller","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0168-0072(96)00037-1_BIB11","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/BF02482893","article-title":"Every finite lattice can be embedded in a finite partition lattice","volume":"10","author":"Pudlak","year":"1980","journal-title":"Algebra Universalis"},{"key":"10.1016\/S0168-0072(96)00037-1_BIB12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01374525","article-title":"A survey of one-way functions in complexity theory","volume":"25","author":"Selman","year":"1992","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0168-0072(96)00037-1_BIB13","first-page":"417","article-title":"On the theory of PTIME degrees of the recursive sets","volume":"40","author":"Shinoda","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0168-0072(96)00037-1_BIB14","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."}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007296000371?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007296000371?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T10:54:33Z","timestamp":1555066473000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007296000371"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0168007296000371"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(96)00037-1","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}