{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:17:41Z","timestamp":1778296661414,"version":"3.51.4"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90140-9","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"225-237","source":"Crossref","is-referenced-by-count":93,"special_numbering":"C","title":["Some remarks on witness functions for nonpolynomial and noncomplete sets in NP"],"prefix":"10.1016","volume":"39","author":[{"given":"Deborah","family":"Joseph","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90140-9_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativization of the P\ue5fbNP question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90140-9_BIB2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphisms and density of NP and other complete sets","volume":"1","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90140-9_BIB3","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. Systems Sci."},{"key":"10.1016\/0304-3975(85)90140-9_BIB4","unstructured":"M. Dowd, On isomorphism, Unpublished manuscript, 1978."},{"key":"10.1016\/0304-3975(85)90140-9_BIB5","first-page":"236","article-title":"Two recursively enumerable sets of incomparable degrees of solvability","volume":"43","author":"Friedberg","year":"1957"},{"key":"10.1016\/0304-3975(85)90140-9_BIB6","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0022-0000(83)90004-1","article-title":"Polynomial time computations in models of ET","volume":"26","author":"Joseph","year":"1983","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(85)90140-9_BIB7","series-title":"Proc. 24th IEEE Symp. on the Foundations of Computer Science","first-page":"439","article-title":"Generalized Kolmogorov complexity and the structure of feasible computations","author":"Hartmanis","year":"1983"},{"key":"10.1016\/0304-3975(85)90140-9_BIB8","unstructured":"K. Ko, Resource-bounded program-size complexity and pseudo-random sequences, Unpublished manuscript."},{"key":"10.1016\/0304-3975(85)90140-9_BIB9","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1137\/0210061","article-title":"Completeness, approximation and density","volume":"10","author":"Ko","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90140-9_BIB10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(80)90017-1","article-title":"Indexings of subrecursive classes","volume":"11","author":"Kozen","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90140-9_BIB11","article-title":"On relative diagonals","author":"Kozen","year":"1980"},{"key":"10.1016\/0304-3975(85)90140-9_BIB12","first-page":"135","article-title":"On the structure of polynomial time reducibility","volume":"2","author":"Ladner","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90140-9_BIB13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1137\/0207003","article-title":"Simple G\u00f6del numberings, isomorphisms, and programming properties","volume":"7","author":"Machtey","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90140-9_BIB14","series-title":"An Introduction to the General Theory of Algorithms","author":"Machtey","year":"1978"},{"issue":"2,3","key":"10.1016\/0304-3975(85)90140-9_BIB15","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0304-3975(85)90139-2","article-title":"Reductions among polynomial isomorphism types","volume":"39","author":"Mahaney","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90140-9_BIB16","first-page":"194","article-title":"On the unsolvability of the problem of reducibility in the theory of algorithms","volume":"108","author":"Muchnik","year":"1956","journal-title":"Doklady Akademii Navk SSSR"},{"key":"10.1016\/0304-3975(85)90140-9_BIB17","series-title":"Proc. 11th ACM Symp. on the Theory of Computing","first-page":"176","article-title":"A programming language theorem that is independent of Peano arithmetic","author":"O'Donnell","year":"1979"},{"key":"10.1016\/0304-3975(85)90140-9_BIB18","doi-asserted-by":"crossref","unstructured":"P. Orponen, D. Russo and U. Sch\u00f6ning, Optimal approximations and polynomially levelable sets, SIAM J. Comput, to appear.","DOI":"10.1137\/0215027"},{"key":"10.1016\/0304-3975(85)90140-9_BIB19","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(85)90140-9_BIB20","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/BF01762189","article-title":"Optimal enumerations and optimal G\u00f6del numberings","volume":"8","author":"Schnorr","year":"1975","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(85)90140-9_BIB21","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\/0304-3975(85)90140-9_BIB22","series-title":"Proc. 15th ACM Symp. Theory of Computing","first-page":"392","article-title":"Some structural properties of polynomial reducibilities and sets in NP","author":"Young","year":"1983"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901409?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901409?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:52:52Z","timestamp":1553158372000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585901409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":22,"alternative-id":["0304397585901409"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90140-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}