{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:55:23Z","timestamp":1757627723360,"version":"3.44.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,3,21]],"date-time":"2004-03-21T00:00:00Z","timestamp":1079827200000},"content-version":"vor","delay-in-days":4616,"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,8]]},"DOI":"10.1016\/0304-3975(91)90045-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["On p-creative sets and p-completely creative sets"],"prefix":"10.1016","volume":"85","author":[{"given":"Jie","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1988","series-title":"Structural Complexity I","author":"Balcazar","key":"10.1016\/0304-3975(91)90045-4_BIB1"},{"key":"10.1016\/0304-3975(91)90045-4_BIB2","series-title":"Ph.D. Thesis","article-title":"Polynomial reducibilities and complete sets","author":"Berman","year":"1977"},{"issue":"2","key":"10.1016\/0304-3975(91)90045-4_BIB3","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)90045-4_BIB4","doi-asserted-by":"crossref","first-page":"579","DOI":"10.2307\/2271984","article-title":"On complexity properties of recursively enumerable sets","volume":"38","author":"Blum","year":"1973","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(91)90045-4_BIB5","series-title":"Ph.D. Thesis","article-title":"Complete problems, creative sets and isomorphism conjectures","author":"Ganesan","year":"1989"},{"key":"10.1016\/0304-3975(91)90045-4_BIB6","doi-asserted-by":"crossref","unstructured":"K. Ganesan and S. Homer, Complete problems and strong polynomial reducibilities, in: Proc. STACS 89, Lecture Notes in Computer Science, Vol. 349, 240\u2013250.","DOI":"10.1007\/BFb0028988"},{"key":"10.1016\/0304-3975(91)90045-4_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 Godel numberings","volume":"17","author":"Hartmanis","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90045-4_BIB8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90144-1","article-title":"On simple and creative sets in NP","volume":"47","author":"Homer","year":"1986","journal-title":"Theoret. Comput. Sci."},{"year":"1979","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","key":"10.1016\/0304-3975(91)90045-4_BIB9"},{"key":"10.1016\/0304-3975(91)90045-4_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(91)90045-4_BIB11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(86)90152-0","article-title":"A note on one-way functions and polynomial-time isomorphisms","volume":"47","author":"Ko","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90045-4_BIB12","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(91)90045-4_BIB13","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(91)90045-4_BIB14","series-title":"Tech. Report #86-008","article-title":"Collapsing degrees","author":"Kurts","year":"1986"},{"year":"1978","series-title":"An Introduction to the General Theory of Algorithms","author":"Machtey","key":"10.1016\/0304-3975(91)90045-4_BIB15"},{"key":"10.1016\/0304-3975(91)90045-4_BIB16","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/malq.19550010205","article-title":"Creative sets","volume":"1","author":"Myhill","year":"1955","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0304-3975(91)90045-4_BIB17","unstructured":"K. Regan, Minimum-complexity pairing functions, Cornell MSI TR #88-92. To appear in J. Comput. System Sci."},{"year":"1967","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","key":"10.1016\/0304-3975(91)90045-4_BIB18"},{"key":"10.1016\/0304-3975(91)90045-4_BIB19","unstructured":"A. Selman, Manuscript on p-isomorphisms."},{"key":"10.1016\/0304-3975(91)90045-4_BIB20","first-page":"236","article-title":"Applications of classical recursion theory to computer science","author":"Smith","year":"1979","journal-title":"Recursion Theory: Its Generalizations and Applications"},{"key":"10.1016\/0304-3975(91)90045-4_BIB21","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/SCT.1989.41811","article-title":"P-creative sets vs. p-completely creative sets","author":"Wang","year":"1989","journal-title":"IEEE Proc. 4th Ann. Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0304-3975(91)90045-4_BIB22","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/SCT.1990.113974","article-title":"P-productivity and polynomial time approximations","author":"Wang","year":"1990","journal-title":"IEEE Proc. 5th Ann. Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0304-3975(91)90045-4_BIB23","series-title":"Ph.D. Thesis","article-title":"Polynomial time creativity and its applications","author":"Wang","year":"1990"},{"key":"10.1016\/0304-3975(91)90045-4_BIB24","series-title":"Ph.D. Thesis","article-title":"On the structure of intractable complexity classes","author":"Watanabe","year":"1987"},{"key":"10.1016\/0304-3975(91)90045-4_BIB25","unstructured":"O. Watanabe, Personal communication."},{"key":"10.1016\/0304-3975(91)90045-4_BIB26","series-title":"Tech. Report #88-06-02","article-title":"Juris Hartmanis: fundamental contributions to isomorphism problems","author":"Young","year":"1988"},{"key":"10.1016\/0304-3975(91)90045-4_BIB27","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591900454?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591900454?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:08Z","timestamp":1757477888000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591900454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["0304397591900454"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90045-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1991,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On p-creative sets and p-completely creative sets","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(91)90045-4","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"}]}}