{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:02:41Z","timestamp":1649181761142},"reference-count":31,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"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":8629,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1016\/0022-0000(89)90023-8","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"250-281","source":"Crossref","is-referenced-by-count":7,"title":["Honest polynomial time reducibilities and the P=?NP problem"],"prefix":"10.1016","volume":"39","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90023-8_BIB1","series-title":"STACS 84, Symp. on Theor. Aspects of Comput. Sci.","first-page":"198","article-title":"On the structure of the polynomial time degrees","volume":"Vol. 166","author":"Ambos-Spies","year":"1984"},{"key":"10.1016\/0022-0000(89)90023-8_BIB2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0019-9958(85)80020-6","article-title":"Sublattices of the polynomial time degrees","volume":"65","author":"Ambos-Spies","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(89)90023-8_BIB3","series-title":"STACS 85, 2nd Annu. Symp. on Theoret. Aspects of Comput. Sic.","first-page":"1","article-title":"On the relative complexity of subproblems of intractable problems","volume":"Vol. 182","author":"Ambos-Spies","year":"1985"},{"key":"10.1016\/0022-0000(89)90023-8_BIB4","series-title":"Proceedings, 26th IEEE Symp. Foundations of Comput. Sci.","first-page":"51","article-title":"Three theorems on polynomial time degrees","author":"Ambos-Spies","year":"1985"},{"key":"10.1016\/0022-0000(89)90023-8_BIB5","series-title":"Trends in Theoretical Computer Science","first-page":"95","article-title":"Polynomial degrees of NP-sets","author":"Ambos-Spies","year":"1987"},{"key":"10.1016\/0022-0000(89)90023-8_BIB6","series-title":"Proceedings, Structure in Complexity Theory, 2nd Annu. Conf","first-page":"60","article-title":"Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem","author":"Ambos-Spies","year":"1987"},{"key":"10.1016\/0022-0000(89)90023-8_BIB7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(87)90053-3","article-title":"Diagonalizations over polynomial time computable sets","volume":"51","author":"Ambos-Spies","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(89)90023-8_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01699457","article-title":"Bi-immune sets for complexity classes","volume":"18","author":"Balcazar","year":"1985","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(89)90023-8_BIB9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphism and density of NP and other complete sets","volume":"1","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90023-8_BIB10","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\/0022-0000(89)90023-8_BIB11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.2307\/2964290","article-title":"Three theorems on recursive enumerations","volume":"23","author":"Friedberg","year":"1958","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(89)90023-8_BIB12","article-title":"Recursion-Theoretic Properties of Minimal Honest Polynomial Degrees","author":"Gasarch","year":"1987"},{"key":"10.1016\/0022-0000(89)90023-8_BIB13","series-title":"Proceedings, 25th IEEE Sympos. Foundations of Comput. Sci.","first-page":"495","article-title":"Complexity measures for public key crypto systems","author":"Grollmann","year":"1984"},{"key":"10.1016\/0022-0000(89)90023-8_BIB14_1","series-title":"Proceedings, 25th IEEE Sympos. Foundations of Comput. Sci.","article-title":"Minimal degrees for polynomial reducibilities","author":"Homer","year":"1984"},{"key":"10.1016\/0022-0000(89)90023-8_BIB14_2","first-page":"480","volume":"34","author":"Homer","year":"1987"},{"key":"10.1016\/0022-0000(89)90023-8_BIB15","first-page":"193","article-title":"Minimal polynomial degrees of nonrecursive sets","volume":"Vol. 1141","author":"Homer","year":"1985"},{"key":"10.1016\/0022-0000(89)90023-8_BIB16_1","series-title":"Honest Polynomial Degrees and P = ?NP","author":"Homer","year":"1986"},{"key":"10.1016\/0022-0000(89)90023-8_BIB16_2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(87)90036-3","volume":"51","author":"Homer","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(89)90023-8_BIB17","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(89)90023-8_BIB18","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\/0022-0000(89)90023-8_BIB19","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"A comparison of the polynomial time reducibilities","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(89)90023-8_BIB20","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\/0022-0000(89)90023-8_BIB21","series-title":"Proceedings, 5th Annu. ACM Symp. on Theory of Comput.","first-page":"130","article-title":"Sets that don't help","author":"Lynch","year":"1973"},{"key":"10.1016\/0022-0000(89)90023-8_BIB22","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/malq.19660120125","article-title":"Classes of r.e. sets and degrees of unsolvability","volume":"12","author":"Martin","year":"1966","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0022-0000(89)90023-8_BIB23","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1090\/S0273-0979-1981-14863-1","article-title":"Strong reducibilities","volume":"4","author":"Odifreddi","year":"1981","journal-title":"Amer. Math. Sac. (N.S.)"},{"key":"10.1016\/0022-0000(89)90023-8_BIB24","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0022-0000(89)90023-8_BIB25","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\/0022-0000(89)90023-8_BIB26","series-title":"Recursively Enumerable Sets and Degrees","author":"Soars","year":"1987"},{"key":"10.1016\/0022-0000(89)90023-8_BIB27","doi-asserted-by":"crossref","first-page":"581","DOI":"10.2307\/1969604","article-title":"On degrees of recursive unsolvability","volume":"64","author":"Spector","year":"1956","journal-title":"Ann. of Math."},{"key":"10.1016\/0022-0000(89)90023-8_BIB28","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1215\/S0012-7094-65-03247-3","article-title":"Three theorems on the degrees of recursively enumerable sets","volume":"32","author":"Yates","year":"1965","journal-title":"Duke Math. J."},{"key":"10.1016\/0022-0000(89)90023-8_BIB29","series-title":"Proceedings 15th Annu. ACM Symp. on Theory of Comput.","first-page":"392","article-title":"Some structural properties of polynomial reducibilities and sets in NP","author":"Young","year":"1983"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900238?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900238?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:55:25Z","timestamp":1550325325000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["0022000089900238"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90023-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}