{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:17:39Z","timestamp":1778296659996,"version":"3.51.4"},"reference-count":27,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,3,25]],"date-time":"2004-03-25T00:00:00Z","timestamp":1080172800000},"content-version":"vor","delay-in-days":4742,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0304-3975(91)90323-t","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"155-163","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":38,"title":["One-way functions and the nonisomorphism of NP-complete sets"],"prefix":"10.1016","volume":"81","author":[{"given":"Juris","family":"Hartmanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lane A.","family":"Hemachandra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/0304-3975(91)90323-T_BIB1","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/0022-0000(88)90033-5","article-title":"Isomorphisms and 1-L reductions","volume":"36","author":"Allender","year":"1988","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/0304-3975(91)90323-T_BIB2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativizations of the P \u225f NP question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90323-T_BIB3","series-title":"Ph.D. Thesis","article-title":"Polynomial reducibilities and complete sets","author":"Berman","year":"1977"},{"issue":"2","key":"10.1016\/0304-3975(91)90323-T_BIB4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphisms and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90323-T_BIB5","unstructured":"K. Ganesan, In preparation."},{"key":"10.1016\/0304-3975(91)90323-T_BIB6","series-title":"STACS 1989: 6th Ann. Symp. on Theoretical Aspects of Computer Science","first-page":"240","article-title":"Complete problems and strong polynomial reducibilities","volume":"349","author":"Ganesan","year":"1989"},{"key":"10.1016\/0304-3975(91)90323-T_BIB7","unstructured":"J. Goldsmith, Personal communication, December 1986."},{"key":"10.1016\/0304-3975(91)90323-T_BIB8","first-page":"390","article-title":"Three results on the polynomial isomorphism of complete sets","author":"Goldsmith","year":"1986","journal-title":"Proc. 27th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90323-T_BIB9","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/0217018","article-title":"Complexity measures for public-key cryptosystems","volume":"17","author":"Grollmann","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90323-T_BIB10","first-page":"439","article-title":"Generalized Kolmogorov complexity and the structure of feasible computations","author":"Hartmanis","year":"1983","journal-title":"Proc. 24th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90323-T_BIB11","series-title":"Proc. 2nd Structure in Complexity Theory Conf.","first-page":"160","article-title":"One-way functions, robustness, and the non-isomorphism of NP-complete sets","author":"Hartmanis","year":"1987"},{"key":"10.1016\/0304-3975(91)90323-T_BIB12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(88)90022-9","article-title":"Complexity classes without machines: on complete languages for UP","volume":"58","author":"Hartmanis","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90323-T_BIB13","series-title":"Proc. 4th Structure in Complexity Theory Conf.","first-page":"3","article-title":"Oracles for structural properties: the isomorphism problem and public-key cryptography","author":"Homer","year":"1989"},{"key":"10.1016\/0304-3975(91)90323-T_BIB14","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(91)90323-T_BIB15","first-page":"295","article-title":"A note on one-way functions and polynomial-time isomorphisms","author":"Ko","year":"1986","journal-title":"18th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90323-T_BIB16","series-title":"Technical Report TR83-001","article-title":"A relativized failure of the Berman-Hartmanis conjecture","author":"Kurtz","year":"1983"},{"key":"10.1016\/0304-3975(91)90323-T_BIB17","series-title":"Complexity Theory Retrospective","first-page":"108","article-title":"The structure of complete degrees","author":"Kurtz","year":"1990"},{"key":"10.1016\/0304-3975(91)90323-T_BIB18","first-page":"380","article-title":"Collapsing degrees","author":"Kurtz","year":"1986","journal-title":"Proc. 27th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(91)90323-T_BIB19","series-title":"Proc. 2nd Structure in Complexity Theory Conf.","first-page":"126","article-title":"Progress on collapsing degrees","author":"Kurtz","year":"1987"},{"key":"10.1016\/0304-3975(91)90323-T_BIB20","series-title":"21st ACM Symp. on Theory of Computing","first-page":"157","article-title":"The isomorphism conjecture fails relative to a random oracle","author":"Kurtz","year":"1989"},{"key":"10.1016\/0304-3975(91)90323-T_BIB21","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."},{"issue":"1","key":"10.1016\/0304-3975(91)90323-T_BIB22","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/322290.322306","article-title":"Relativized questions involving probabilistic algorithms","volume":"29","author":"Rackoff","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90323-T_BIB23","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","article-title":"The relative complexity of checking and evaluating","volume":"5","author":"Valiant","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(91)90323-T_BIB24","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0304-3975(85)90218-X","article-title":"On one-one P-equivalence relations","volume":"38","author":"Watanabe","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90323-T_BIB25","article-title":"A note on the P-isomorphism conjecture","volume":"84","author":"Watanabe","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90323-T_BIB26","first-page":"392","article-title":"Some structural properties of polynomial reducibilities and sets in NP","author":"Young","year":"1983","journal-title":"Proc. 15th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90323-T_BIB27","series-title":"Complexity Theory Retrospective","first-page":"138","article-title":"Juris Hartmanis: fundamental contributions to isomorphism problems","author":"Young","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190323T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190323T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:24Z","timestamp":1757477904000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190323T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["030439759190323T"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90323-t","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"One-way functions and the nonisomorphism of NP-complete sets","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(91)90323-T","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}