{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:17Z","timestamp":1759638497807},"reference-count":41,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1985]]},"DOI":"10.1016\/0304-3975(85)90085-4","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"1-30","source":"Crossref","is-referenced-by-count":57,"special_numbering":"C","title":["On some natural complete operators"],"prefix":"10.1016","volume":"37","author":[{"given":"Ker-I","family":"Ko","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90085-4_BIB1","series-title":"Proc. 19th IEEE Symp. on Foundations of Computer Science","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978"},{"key":"10.1016\/0304-3975(85)90085-4_BIB2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(80)90027-4","article-title":"On counting problems and the polynomial-time hierarchy","volume":"12","author":"Angluin","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90085-4_BIB3","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(85)90085-4_BIB4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(79)90043-4","article-title":"A second step toward the polynomial hierarchy","volume":"8","author":"Baker","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90085-4_BIB5","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle A, PA \u2260 NPA \u2260 coNPA with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM. J. Comput."},{"key":"10.1016\/0304-3975(85)90085-4_BIB6","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(85)90085-4_BIB7","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1137\/0208035","article-title":"Polynomial space and transitive closure","volume":"8","author":"Book","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90085-4_BIB8","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1137\/0213030","article-title":"Quantitative relativizations of complexity classes","volume":"13","author":"Book","year":"1984","journal-title":"SIAM J. Comput."},{"year":"1984","series-title":"Qualitative relativizations of complexity classes","author":"Book","key":"10.1016\/0304-3975(85)90085-4_BIB9"},{"key":"10.1016\/0304-3975(85)90085-4_BIB10","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF01786987","article-title":"A note on complete sets and transitive closure","volume":"15","author":"Book","year":"1982","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(85)90085-4_BIB11","series-title":"Proc. 5th ACM Symp. on Theory of Computing","first-page":"108","article-title":"Type two computational complexity","author":"Constable","year":"1973"},{"key":"10.1016\/0304-3975(85)90085-4_BIB12","series-title":"Proc. 3rd ACM Symp. on Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedure","author":"Cook","year":"1971"},{"key":"10.1016\/0304-3975(85)90085-4_BIB13","first-page":"80","article-title":"On the computational complexity of maximization and integration","volume":"53","author":"Friedman","year":"1984","journal-title":"Advances in Applied Math."},{"year":"1979","series-title":"Computers and Intractability","author":"Garey","key":"10.1016\/0304-3975(85)90085-4_BIB14"},{"year":"1978","series-title":"Feasible Computations and Provable Complexity Properties","author":"Harrmanis","key":"10.1016\/0304-3975(85)90085-4_BIB15"},{"key":"10.1016\/0304-3975(85)90085-4_BIB16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/1008335.1008336","article-title":"Independence result in computer science","volume":"8","author":"Hartmanis","year":"1976","journal-title":"SIGACT News"},{"key":"10.1016\/0304-3975(85)90085-4_BIB17","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01744434","article-title":"Relativized polynomial hierarchies extending two levels","volume":"17","author":"Heller","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(85)90085-4_BIB18","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(83)90003-8","article-title":"Oracle-dependent properties of the lattice of NP sets","volume":"24","author":"Homer","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90085-4_BIB19","series-title":"Proc. 12th ACM Symp. on Theory of Computing","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/0304-3975(85)90085-4_BIB20","doi-asserted-by":"crossref","DOI":"10.1137\/0214003","article-title":"On circuit-size complexity and the low hierarchy in NP","author":"Ko","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90085-4_BIB21","series-title":"Proc. 10th ACM Symp. on Theory of Computing","first-page":"287","article-title":"Indexing of subrecursive classes","author":"Kozen","year":"1978"},{"key":"10.1016\/0304-3975(85)90085-4_BIB22","article-title":"On relative diagonals","author":"Kozen","year":"1980","journal-title":"IBM Research Report RC 8184"},{"key":"10.1016\/0304-3975(85)90085-4_BIB23","series-title":"Proc. 14th ACM Symp. on Theory of Computing","first-page":"224","article-title":"On the random oracle hypothesis","author":"Kurtz","year":"1982"},{"year":"1983","series-title":"On sparse sets in NP = P: relativizations","author":"Kurtz","key":"10.1016\/0304-3975(85)90085-4_BIB24"},{"key":"10.1016\/0304-3975(85)90085-4_BIB25","doi-asserted-by":"crossref","first-page":"555","DOI":"10.2307\/2271779","article-title":"\u201cHelping\u201d: Several formalizations","volume":"40","author":"Lynch","year":"1975","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(85)90085-4_BIB26","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/S0002-9947-1976-0403933-6","article-title":"Relativization of the theory of computational complexity","volume":"220","author":"Lynch","year":"1976","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(85)90085-4_BIB27","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","article-title":"Riemann's hypothesis and tests for primality","volume":"13","author":"Miller","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90085-4_BIB28","series-title":"Proc. 14th ACM Symp. on Theory of Computing","first-page":"255","article-title":"The complexity of facets","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0304-3975(85)90085-4_BIB29","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. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(85)90085-4_BIB30","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90085-4_BIB31","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0022-0000(83)90027-2","article-title":"A high and a low hierarchy within NP","volume":"27","author":"Sch\u00f6ning","year":"1983","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/0304-3975(85)90085-4_BIB32","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(84)90058-6","article-title":"On small generators","volume":"34","author":"Sch\u00f6ning","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90085-4_BIB33","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0213023","article-title":"Immunity, relativizations and nondeterminism","volume":"13","author":"Sch\u00f6ning","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90085-4_BIB34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1976","journal-title":"Theoret. Comput. Sci."},{"article-title":"The extension of machine-independent computationa. complexity theory to oracle machine computation and to the computation of finite functions","year":"1971","author":"Symes","key":"10.1016\/0304-3975(85)90085-4_BIB35"},{"key":"10.1016\/0304-3975(85)90085-4_BIB36","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","article-title":"Relative complexity of checking and evaluating","volume":"5","author":"Valiant","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(85)90085-4_BIB37","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90085-4_BIB38","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of reliability and enumeration problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90085-4_BIB39","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial hierarchy","volume":"3","author":"Wrathall","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90085-4_BIB40","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(83)90020-8","article-title":"Some consequences of non-uniform conditions on uniform classes","volume":"26","author":"Yap","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90085-4_BIB41","series-title":"Proc. 15th ACM Symp. on Theory of Computing","first-page":"382","article-title":"Some structural properties of polynomial reducibilities and sets in NP","author":"Young","year":"1983"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900854?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900854?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:52:46Z","timestamp":1553172766000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585900854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":41,"alternative-id":["0304397585900854"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90085-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1985]]}}}