{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:07:50Z","timestamp":1760202470917},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"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":6163,"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":[[1996,9]]},"DOI":"10.1016\/0304-3975(95)00189-1","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"141-163","source":"Crossref","is-referenced-by-count":51,"title":["Cook versus Karp-Levin: Separating completeness notions if NP is not small"],"prefix":"10.1016","volume":"164","author":[{"given":"Jack H.","family":"Lutz","sequence":"first","affiliation":[]},{"given":"Elvira","family":"Mayordomo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00189-1_BIB1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/S0097539792228289","article-title":"The complexity of decision versus search","volume":"23","author":"Bellare","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00189-1_BIB2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphism and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00189-1_BIB3","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(74)90473-2","article-title":"Tally languages and complexity classes","volume":"26","author":"Book","year":"1974","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00189-1_BIB4","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF02090397","article-title":"Completeness for nondeterministic complexity classes","volume":"24","author":"Buhrman","year":"1991","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(95)00189-1_BIB5","series-title":"Proc. Third ACM Symp on the Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0304-3975(95)00189-1_BIB6","series-title":"Proc. Fifth Annual Structure in Complexity Theory Conf.","first-page":"3","article-title":"Structural properties of nondeterministic complete sets","author":"Homer","year":"1990"},{"key":"10.1016\/0304-3975(95)00189-1_BIB7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1137\/S0097539792238133","article-title":"The complexity and distribution of hard problems","volume":"24","author":"Juedes","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00189-1_BIB8","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(95)00189-1_BIB9","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(95)00189-1_BIB10","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\/0304-3975(95)00189-1_BIB11","first-page":"265","article-title":"Universal sequential search problems","volume":"9","author":"Levin","year":"1973","journal-title":"Problems of Information Transmission"},{"key":"10.1016\/0304-3975(95)00189-1_BIB12","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0022-0000(90)90026-H","article-title":"Cook reducibility is faster than Karp reducibility in NP","volume":"41","author":"Longpr\u00e9","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00189-1_BIB13","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","article-title":"Almost everywhere high nonuniform complexity","volume":"44","author":"Lutz","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00189-1_BIB14","unstructured":"J.H. Lutz, Resource-bounded measure, in preparation."},{"key":"10.1016\/0304-3975(95)00189-1_BIB15","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1137\/S0097539792237498","article-title":"Measure, stochasticity, and the density of hard languages","volume":"23","author":"Lutz","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00189-1_BIB16","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/0304-3975(94)00023-C","article-title":"Almost every set in exponential time is P-bi-immune","volume":"136","author":"Mayordomo","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00189-1_BIB17","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphism and density of NP and other complete sets","volume":"6","author":"Meyer","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00189-1_BIB18","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/0220030","article-title":"On polynomial bounded truth-table reducibility of NP sets to sparse sets","volume":"20","author":"Ogiwara","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00189-1_BIB19","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/S0019-9958(86)80024-9","article-title":"The density and complexity of polynomial cores for intractable sets","volume":"70","author":"Orponen","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00189-1_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00538763","article-title":"Klassifikation der Zufallsgesetze nach Komplexit\u00e4t und Ordnung","volume":"16","author":"Schnorr","year":"1970","journal-title":"Z. Wahrscheinlich-keitstheorie verw. Geb."},{"key":"10.1016\/0304-3975(95)00189-1_BIB21","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/BF01694181","article-title":"A unified approach to the definition of random sequences","volume":"5","author":"Schnorr","year":"1971","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(95)00189-1_BIB22","article-title":"Zuf\u00e4lligkeit und Wahrscheinlichkeit","volume":"Vol. 218","author":"Schnorr","year":"1971"},{"key":"10.1016\/0304-3975(95)00189-1_BIB23","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","article-title":"Process complexity and effective random tests","volume":"7","author":"Schnorr","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00189-1_BIB24","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 Theory"},{"key":"10.1016\/0304-3975(95)00189-1_BIB25","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\/0304-3975(95)00189-1_BIB26","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0304-3975(87)90132-0","article-title":"A comparison of polynomial time completeness notions","volume":"54","author":"Watanabe","year":"1987","journal-title":"Theoret. Comput. Sci."},{"article-title":"On the Structure of Intractable Complexity Classes","year":"1987","author":"Watanabe","key":"10.1016\/0304-3975(95)00189-1_BIB27"},{"key":"10.1016\/0304-3975(95)00189-1_BIB28","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0304-3975(92)90074-P","article-title":"On polynomial time Turing and many-one completeness in PSPACE","volume":"97","author":"Watanabe","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00189-1_BIB29","series-title":"Proc. Fifteenth ACM Symp. on Theory of Computing","first-page":"392","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:0304397595001891?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001891?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:56:04Z","timestamp":1555390564000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001891"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0304397595001891"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00189-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}