{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T15:40:26Z","timestamp":1704210026420},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"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":8904,"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":[[1989,3]]},"DOI":"10.1016\/0304-3975(89)90015-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"239-252","source":"Crossref","is-referenced-by-count":9,"title":["On inefficient special cases of NP-complete problems"],"prefix":"10.1016","volume":"63","author":[{"given":"Ding-Zhu","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald V.","family":"Book","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90015-7_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01699457","article-title":"Bi-immunity for complexity classes","volume":"18","author":"Balc\u00e1zar","year":"1985","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/0304-3975(89)90015-7_BIB2","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(89)90015-7_BIB3","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/28869.28880","article-title":"The existence and density of generalized complexity cores","volume":"34","author":"Book","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(89)90015-7_BIB4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/PSCT.1987.10319264","article-title":"On sets truth-table reducible to sparse sets","author":"Book","year":"1987","journal-title":"Proc. 2nd IEEE Conf. Structure in Complexity Theory"},{"key":"10.1016\/0304-3975(89)90015-7_BIB5","series-title":"Ph.D. Dissertation","article-title":"Generalized complexity cores and the levelability of intractable sets","author":"Du","year":"1985"},{"key":"10.1016\/0304-3975(89)90015-7_BIB6","series-title":"Structural properties of complexity cores","author":"Du","year":"1985"},{"key":"10.1016\/0304-3975(89)90015-7_BIB7","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\/0304-3975(89)90015-7_BIB8","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\/0304-3975(89)90015-7_BIB9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01699469","article-title":"Nonlevelable sets and immune sets in the accepting density hierarchy in NP","volume":"18","author":"Ko","year":"1985","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/0304-3975(89)90015-7_BIB10","first-page":"277","article-title":"On the structure of polynomial time reducibility","volume":"2","author":"Ladner","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(89)90015-7_BIB11","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/321892.321895","article-title":"On reducibility to complex or sparse sets","volume":"22","author":"Lynch","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(89)90015-7_BIB12","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","article-title":"Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis","volume":"25","author":"Mahaney","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(89)90015-7_BIB13","series-title":"Technical Rept. TM-126","article-title":"With what frequency are apparently intractable problems difficult?","author":"Meyer","year":"1979"},{"key":"10.1016\/0304-3975(89)90015-7_BIB14","series-title":"Ph.D. Dissertation","article-title":"The structure of polynomial complexity cores","author":"Orponen","year":"1986"},{"key":"10.1016\/0304-3975(89)90015-7_BIB15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0304-3975(86)90140-4","article-title":"A classification of complexity core lattices","volume":"47","author":"Orponen","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90015-7_BIB16","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1137\/0215027","article-title":"Optimal approximations and polynomially levelable sets","volume":"15","author":"Orponen","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90015-7_BIB17_1","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(89)90015-7_BIB17_2","series-title":"Proc. 11th Symp. Math. Found. Computer Science","first-page":"452","article-title":"The density and complexity of polynomial cores for intractable sets","volume":"176","author":"Orponen","year":"1984"},{"key":"10.1016\/0304-3975(89)90015-7_BIB18","series-title":"Structure in Complexity Theory","first-page":"311","article-title":"Optimal approximations of complete sets","volume":"223","author":"Russo","year":"1984"},{"key":"10.1016\/0304-3975(89)90015-7_BIB19","series-title":"Ph.D. Dissertation","article-title":"Structural properties of complexity cores","author":"Russo","year":"1985"},{"key":"10.1016\/0304-3975(89)90015-7_BIB20","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01692061","article-title":"On P-subset structures","volume":"20","author":"Russo","year":"1987","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(89)90015-7_BIB21","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1109\/PSCT.1987.10319263","article-title":"Polynomial time reducibility to a set of small density","author":"Watanabe","year":"1987","journal-title":"Proc. 2nd IEEE Conf. Structure in Complexity Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900157?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900157?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T15:12:14Z","timestamp":1704208334000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["0304397589900157"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90015-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}