{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T04:50:47Z","timestamp":1743915047231},"reference-count":30,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":8264,"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":[[1990,12]]},"DOI":"10.1016\/0022-0000(90)90026-h","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"389-401","source":"Crossref","is-referenced-by-count":17,"title":["Cook reducibility is faster than Karp reducibility in NP"],"prefix":"10.1016","volume":"41","author":[{"given":"Luc","family":"Longpr\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90026-H_BIB1","series-title":"Proceedings, 3rd ACM Symp. Theory of Comput.","first-page":"151","article-title":"The complexity of theorem-providing procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0022-0000(90)90026-H_BIB2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0022-0000(73)80028-5","article-title":"A hierarchy for nondeterministic time complexity","volume":"7","author":"Cook","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(90)90026-H_BIB3","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(90)90026-H_BIB4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(87)90036-3","article-title":"Honest polynomial degrees and P = ? NP","volume":"51","author":"Homer","year":"1987","journal-title":"Theoret. Comput. Sci."},{"issue":"No.(2)","key":"10.1016\/0022-0000(90)90026-H_BIB5","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1145\/23005.23009","article-title":"Minimal degrees for polynomial reducibilities","volume":"34","author":"Homer","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90026-H_BIB6","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(90)90026-H_BIB7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(85)90140-9","article-title":"Some remarks on witness functions for non-polynomial and non-complete sets in NP","volume":"39","author":"Joseph","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(90)90026-H_BIB8","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0022-0000(90)90026-H_BIB9","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":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(90)90026-H_BIB10","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(90)90026-H_BIB11_1","series-title":"Proceedings, 27th Symp. on Found. Comput. Sci.","first-page":"380","article-title":"Collapsing degrees","author":"Kurtz","year":"1986"},{"key":"10.1016\/0022-0000(90)90026-H_BIB11_2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0022-0000(88)90007-4","volume":"37","author":"Kurtz","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(90)90026-H_BIB12","series-title":"Complexity Theory Retrospective","article-title":"On the structure of complete sets","author":"Kurtz","year":"1990"},{"key":"10.1016\/0022-0000(90)90026-H_BIB13","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(90)90026-H_BIB14","unstructured":"L. Longpr\u00e9, Comparative efficiency of various reductions in NP, in preparation."},{"key":"10.1016\/0022-0000(90)90026-H_BIB15","series-title":"Elements of the Theory of Computation","author":"Lewis","year":"1981"},{"key":"10.1016\/0022-0000(90)90026-H_BIB16","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0022-0000(75)80039-0","article-title":"On the density of honest subrecursive classes","volume":"10","author":"Machtey","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(90)90026-H_BIB17","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/malq.19720180405","article-title":"A classification of the recursive functions","volume":"18","author":"Meyer","year":"1972","journal-title":"Z. Math. Logik Grundlag. Math."},{"issue":"No.2","key":"10.1016\/0022-0000(90)90026-H_BIB18","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0304-3975(85)90139-2","article-title":"Orderings of polynomial isomorphism types","volume":"39","author":"Mahaney","year":"1985","journal-title":"Theoret. Comput. Sci."},{"issue":"No.2","key":"10.1016\/0022-0000(90)90026-H_BIB19","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/62.322435","article-title":"On the complexity of unique solutions","volume":"31","author":"Papadimitriou","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90026-H_BIB20","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","article-title":"Recursively enumerable sets of integers and their decision problems","volume":"50","author":"Post","year":"1944","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0022-0000(90)90026-H_BIB21_1","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0022-0000(90)90026-H_BIB21_2","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1987"},{"key":"10.1016\/0022-0000(90)90026-H_BIB22","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\/0022-0000(90)90026-H_BIB23","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(90)90026-H_BIB24","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/0022-0000(90)90026-H_BIB25","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."},{"key":"10.1016\/0022-0000(90)90026-H_BIB26","article-title":"On the Structure of Intractable Complexity Classes","author":"Watanabe","year":"1987"},{"key":"10.1016\/0022-0000(90)90026-H_BIB27","series-title":"Proceedings, Fifteenth ACM Symp. on Theory of Comput.","first-page":"392","article-title":"Some structural properties of polynomial reducibilities and sets in NP","author":"Young","year":"1983"},{"key":"10.1016\/0022-0000(90)90026-H_BIB28","series-title":"Complexity Theory Retrospective","article-title":"Juris Hartmanis: Fundamental contributions to isomorphism problems","author":"Young","year":"1990"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090026H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090026H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:56:02Z","timestamp":1550325362000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090026H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["002200009090026H"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90026-h","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}