{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:40:18Z","timestamp":1742593218136,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540535041"},{"type":"electronic","value":"9783540466772"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53504-7_71","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:06:48Z","timestamp":1330207608000},"page":"144-153","source":"Crossref","is-referenced-by-count":3,"title":["Some remarks on polynomial time isomorphisms"],"prefix":"10.1007","author":[{"given":"Jie","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"16_CR1","unstructured":"L. Berman, Polynomial reducibilities and complete sets, Ph.D. thesis, Cornell University, 1977."},{"key":"16_CR2","unstructured":"K. Ganesan, Complete problems, creative sets and isomorphism conjectures, Ph.D. thesis, Boston University, 1989."},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/0217018","volume":"17","author":"J. Grollmann","year":"1988","unstructured":"J. Grollmann and A. Selman, Complexity measures for public-key cryptosystems, SIAM J. Comput., 17(1988) 309\u2013335.","journal-title":"SIAM J. Comput."},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(85)90140-9","volume":"39","author":"D. Joseph","year":"1985","unstructured":"D. Joseph and P. Young, Some remarks on witness functions for nonpolynomial and noncomplete sets in NP, Theoret. Comput. Sci., 39(1985) 225\u2013237.","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(86)90152-0","volume":"47","author":"K. Ko","year":"1986","unstructured":"K. Ko, T. Long, and D. Du, A note on one-way functions and polynomial-time isomorphisms, Theoretical Computer Science, 47(1986) 263\u2013276.","journal-title":"Theoretical Computer Science"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"S. Kurtz, S. Mahaney, and J. Royer, Collapsing Degrees, University of Chicago, TR-86-006, 1986.","DOI":"10.1109\/SFCS.1986.13"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0304-3975(85)90139-2","volume":"39","author":"S. Mahaney","year":"1985","unstructured":"S. Mahaney and P. Young, Reductions among polynomial isomorphism types, Theoretical Computer Science, 39(1985) 207\u2013224.","journal-title":"Theoretical Computer Science"},{"key":"16_CR8","first-page":"97","volume":"1","author":"J. Myhill","year":"1955","unstructured":"J. Myhill, Creative Sets, ZML 1(1955) 97\u2013103.","journal-title":"ZML"},{"key":"16_CR9","unstructured":"H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill Book, 1967."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"J. Wang, On p-creative sets and p-completely creative sets, to appear in Theoretical Computer Science. The earlier version of this paper appeared in IEEE Proceedings of the 4th Annual Conference on Structure in Complexity Theory, June 1989, 24\u201333.","DOI":"10.1109\/SCT.1989.41811"}],"container-title":["Lecture Notes in Computer Science","Advances in Computing and Information \u2014 ICCI '90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53504-7_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:08:55Z","timestamp":1742591335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53504-7_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540535041","9783540466772"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-53504-7_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}