{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:18:29Z","timestamp":1778296709687,"version":"3.51.4"},"reference-count":27,"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)90139-2","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"207-224","source":"Crossref","is-referenced-by-count":43,"special_numbering":"C","title":["Reductions among polynomial isomorphism types"],"prefix":"10.1016","volume":"39","author":[{"given":"Stephen R.","family":"Mahaney","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)90139-2_BIB1","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphism and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90139-2_BIB2","series-title":"5th Internat. Coll. on Automata, Languages, and Programming","first-page":"63","article-title":"Relationship between density and deterministic complexity of NP-complete languages","volume":"62","author":"Berman","year":"1978"},{"key":"10.1016\/0304-3975(85)90139-2_BIB3","series-title":"IEEE Proc. 10th Ann. Symp. on Switching and Automata Theory","first-page":"7","article-title":"Dense and nondense families of complexity classes","author":"Borodin","year":"1969"},{"key":"10.1016\/0304-3975(85)90139-2_BIB4","unstructured":"M. Dowd, On isomorphism, Unpublished manuscript, 1978."},{"key":"10.1016\/0304-3975(85)90139-2_BIB5","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0208034","article-title":"A note on sparse complete sets","volume":"6","author":"Fortune","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90139-2_BIB6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0304-3975(78)90018-X","article-title":"On log-tape isomorphisms of complete sets","volume":"7","author":"Hartmanis","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90139-2_BIB7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0304-3975(82)90132-3","article-title":"A note on natural complete sets and G\u00f6del numberings","volume":"17","author":"Hartmanis","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90139-2_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0204001","article-title":"On simple G\u00f6del numberings and translations","volume":"4","author":"Hartmanis","year":"1975","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0304-3975(85)90139-2_BIB9","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(83)90003-8","article-title":"Oracle-dependent properties of the lattice of NP sets","volume":"24","author":"Homer","year":"1983","journal-title":"Theoret. Comput. Sci."},{"issue":"2,3","key":"10.1016\/0304-3975(85)90139-2_BIB10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(85)90140-9","article-title":"Some remarks on witness functions for nonpolynomial and noncomplete sets in NP","volume":"39","author":"Joseph","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90139-2_BIB11","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)90139-2_BIB12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1137\/0214008","article-title":"On sparse stes in NP-P: Relativizations","volume":"14","author":"Kurtz","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90139-2_BIB13","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."},{"issue":"3","key":"10.1016\/0304-3975(85)90139-2_BIB14","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":"Inform. & Control"},{"key":"10.1016\/0304-3975(85)90139-2_BIB15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0022-0000(75)80039-0","article-title":"On the density of honest subrecursive classes","volume":"10","author":"Machtey","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90139-2_BIB16","series-title":"An Introduction to the General Theory of Algorithms","author":"Machtey","year":"1978"},{"key":"10.1016\/0304-3975(85)90139-2_BIB17","series-title":"Proc. 22nd Ann. IEEE Symp. on Foundations of Computer Science","first-page":"271","article-title":"On the number of P-isomorphism classes of NP-complete sets","author":"Mahaney","year":"1981"},{"key":"10.1016\/0304-3975(85)90139-2_BIB18","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","article-title":"Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis","volume":"25","author":"Mahaney","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90139-2_BIB19","first-page":"117","article-title":"\u00dcber gewisse universelle Relationen","volume":"17","author":"Mostowski","year":"1938","journal-title":"Polskiego Tow Matematycznego"},{"key":"10.1016\/0304-3975(85)90139-2_BIB20","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","article-title":"Recursively enumerable sets of positive integers and their decision problems","volume":"50","author":"Post","year":"1944","journal-title":"Bulletin AMS"},{"key":"10.1016\/0304-3975(85)90139-2_BIB21","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(85)90139-2_BIB22","series-title":"Degrees of Unsolvability","author":"Sacks","year":"1966"},{"key":"10.1016\/0304-3975(85)90139-2_BIB23","doi-asserted-by":"crossref","first-page":"70","DOI":"10.2307\/2270621","article-title":"Linear orderings under one-one reducibility","volume":"31","author":"Young","year":"1966","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(85)90139-2_BIB24","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/BF01691468","article-title":"A note on dense and nondense families of complexity classes","volume":"5","author":"Young","year":"1971","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(85)90139-2_BIB25","first-page":"377","article-title":"Some analogues of recursion theoretic results for polynomial reducibilities in NP","volume":"3","author":"Young","year":"1982","journal-title":"Notices AMS"},{"key":"10.1016\/0304-3975(85)90139-2_BIB26","first-page":"392","article-title":"Some structural properties of polynomial reducibilities and sets in NP","volume":"15","author":"Young","year":"1983"},{"key":"10.1016\/0304-3975(85)90139-2_BIB27","unstructured":"P. Young, Cook-reducibility is faster than Karp-reducibility by honest functions on NP-complete sets, In preparation."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901392?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901392?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\/0304397585901392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":27,"alternative-id":["0304397585901392"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90139-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}