{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T05:10:54Z","timestamp":1735017054968,"version":"3.32.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1007\/bf01191472","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:09:40Z","timestamp":1108728580000},"page":"109-116","source":"Crossref","is-referenced-by-count":1,"title":["Productive functions and isomorphisms"],"prefix":"10.1007","volume":"28","author":[{"given":"Jie","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"L. Berman, Polynomial reducibilities and complete sets, Ph.D. thesis, Cornell University, 1977.","key":"CR1"},{"issue":"2","key":"CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","volume":"6","author":"L. Berman","year":"1977","unstructured":"L. Berman and J. Hartmanis, On isomorphisms and density of NP and other complete sets,SIAM J. Comput,6(2) (1977), 305?322.","journal-title":"SIAM J. Comput"},{"key":"CR3","first-page":"240","volume-title":"Lecture Notes in Computer Science, Vol. 349","author":"K. Ganesan","year":"1989","unstructured":"K. Ganesan and S. Homer, Complete problems and strong polynomial reducibilities,Proc. STAGS 89, Lecture Notes in Computer Science, Vol. 349, Springer-Verlag, Berlin, 1989, pp. 240?250."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/inco.1994.1026","volume":"110","author":"S. Homer","year":"1994","unstructured":"S. Homer and J. Wang, Immunity of complete problems.Inform. and Comput.,110 (1994), 119?129.","journal-title":"Inform. and Comput."},{"key":"CR5","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?237.","journal-title":"Theoret. Comput. Sci."},{"key":"CR6","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 Z. Du, A note on one-way functions and polynomial-time isomorphisms,Theoret. Comput. Sci.,47 (1986), 263?276.","journal-title":"Theoret. Comput. Sci."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1137\/0210061","volume":"10","author":"K. Ko","year":"1981","unstructured":"K. Ko and D. Moore, Completeness, approximation and density,SIAM J. Comput.,10 (1981), 787?796.","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"S. Kurtz, S. Mahaney, and J. Royer, Collapsing Degrees, Tech. Report #86-008, University of Chicago, 1986.","key":"CR8","DOI":"10.1109\/SFCS.1986.13"},{"key":"CR9","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,Theoret. Comput. Sci.,39 (1985), 207?224.","journal-title":"Theoret. Comput. Sci."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1137\/0215027","volume":"15","author":"P. Orponen","year":"1986","unstructured":"P. Orponen, D. Russo, and U. Sch\u00f6ming, Optimal approximations and polynomially levelable sets,SIAM J. Comput,15 (1986), 399?408.","journal-title":"SIAM J. Comput"},{"key":"CR11","first-page":"88","volume-title":"Lecture Notes in Computer Science, Vol. 452","author":"A. Selman","year":"1990","unstructured":"A. Selman,One-Way Functions in Complexity Theory, Lecture Notes in Computer Science, Vol. 452, Springer-Verlag, Berlin, 1990, pp. 88?104."},{"doi-asserted-by":"crossref","unstructured":"J. Wang, P-creative sets vs, p-completely creative sets,IEEE Proc. 4th Annual Conference on Structure in Complexity Theory, June 1989, pp. 24?33.","key":"CR12","DOI":"10.1109\/SCT.1989.41811"},{"key":"CR13","first-page":"144","volume-title":"Lecture Notes in Computer Science, Vol. 468","author":"J. Wang","year":"1990","unstructured":"J. Wang,Some Remarks on Polynomial Time Isomorphisms, Lecture Notes in Computer Science, Vol. 468, Springer-Verlag, Berlin, 1990, pp. 144?153."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(91)90045-4","volume":"85","author":"J. Wang","year":"1991","unstructured":"J. Wang, On p-creative sets and p-completely creative sets,Theoret. Comput. Sci.,85 (1991), 1?31.","journal-title":"Theoret. Comput. Sci."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01191472.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01191472\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01191472","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T12:19:24Z","timestamp":1734956364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01191472"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["BF01191472"],"URL":"https:\/\/doi.org\/10.1007\/bf01191472","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"type":"print","value":"0025-5661"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}