{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:52:07Z","timestamp":1762210327557},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,4,1]],"date-time":"1983-04-01T00:00:00Z","timestamp":418003200000},"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":11065,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1983,4]]},"DOI":"10.1016\/0022-0000(83)90013-2","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"209-221","source":"Crossref","is-referenced-by-count":111,"title":["On self-reducibility and weak P-selectivity"],"prefix":"10.1016","volume":"26","author":[{"given":"Ker-I","family":"Ko","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90013-2_BIB1","series-title":"Proceedings, 19th IEEE Symposium on Foundations of Computer Science","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978"},{"key":"10.1016\/0022-0000(83)90013-2_BIB2","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle A, PA \u2260 NPA \u2260 co-NPA with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90013-2_BIB3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0304-3975(78)90007-5","article-title":"Some lowness properties and computational complexity sequences","volume":"6","author":"Bennison","year":"1978","journal-title":"Theoret. Comput. Cci."},{"key":"10.1016\/0022-0000(83)90013-2_BIB4","series-title":"Proceedings, 4th GI Conference on Theoretical Computer Science","first-page":"58","article-title":"Information content characterizations of complexity theoretic properties","author":"Bennison","year":"1979"},{"key":"10.1016\/0022-0000(83)90013-2_BIB5","series-title":"Proceedings, 17th Symposium on Foundations of Computer Science","first-page":"76","article-title":"On the structure of complete sets: Almost everywhere complexity and infinitely often speed up","author":"Berman","year":"1976"},{"key":"10.1016\/0022-0000(83)90013-2_BIB6","series-title":"Proceedings, 5th International Colloquium Automata, Languages and Programming","first-page":"63","article-title":"Relationship between density and deterministic complexity of NP-complete languages","author":"Berman","year":"1978"},{"key":"10.1016\/0022-0000(83)90013-2_BIB7","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphism and densities of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90013-2_BIB8","series-title":"Proceedings, 3rd ACM Symposium on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0022-0000(83)90013-2_BIB9","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0208034","article-title":"A note on sparse complete sets","volume":"8","author":"Fortune","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90013-2_BIB10","series-title":"Proceedings, 12th ACM Symposium on Theory of Computing","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/0022-0000(83)90013-2_BIB11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0022-0000(82)90053-8","article-title":"The maximum value problem and NP real numbers","volume":"24","author":"Ko","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90013-2_BIB12","unstructured":"K. Ko, A note on circuit-size complexity and the low hierarchy in NP, SIAM J. Comput., to appear."},{"key":"10.1016\/0022-0000(83)90013-2_BIB13","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\/0022-0000(83)90013-2_BIB14","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"A comparison of polynomial time reducibilities","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(83)90013-2_BIB15","series-title":"Proceedings, 21st IEEE Symposium on Foundations of Computer Science","first-page":"54","article-title":"Sparse complete sets for NP: Solution of a conjecture by Berman and Hartmanis","author":"Mahaney","year":"1980"},{"key":"10.1016\/0022-0000(83)90013-2_BIB16","article-title":"With What Frequency Are Apparently Intractable Problem Difficult?","author":"Meyer","year":"1979","journal-title":"MIT Tech. Rep., MIT\/LES\/TM-126"},{"key":"10.1016\/0022-0000(83)90013-2_BIB17","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0022-0000(83)90013-2_BIB18","doi-asserted-by":"crossref","unstructured":"U. Sch\u00f6ning, A low and a high hierarchy within NP, J. Comput. System Sci., to appear.","DOI":"10.1016\/0022-0000(83)90027-2"},{"key":"10.1016\/0022-0000(83)90013-2_BIB19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01744288","article-title":"P-selective sets, tally languages and the behavior of polynomial time reducibilities on NP","volume":"13","author":"Selman","year":"1979","journal-title":"Math. Systems Teory"},{"key":"10.1016\/0022-0000(83)90013-2_BIB20","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/0022-0000(81)90068-4","article-title":"Some observations on NP real numbers and p-selective sets","volume":"23","author":"Selman","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90013-2_BIB21","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(82)90039-1","article-title":"Reductions on NP and p-selective sets","volume":"19","author":"Selman","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(83)90013-2_BIB22","doi-asserted-by":"crossref","first-page":"545","DOI":"10.2307\/2271876","article-title":"Computational complexity, speedable and levelable sets","volume":"42","author":"Scare","year":"1977","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(83)90013-2_BIB23","series-title":"Proceedings, 5th ACM Symposium on Theory of Computing","first-page":"1","article-title":"Word problems requiring exponential time","author":"Stockmeyer","year":"1973"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900132?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900132?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T16:48:15Z","timestamp":1585327695000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,4]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,4]]}},"alternative-id":["0022000083900132"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90013-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,4]]}}}