{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:11:35Z","timestamp":1648980695794},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":7321,"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":[[1993,7]]},"DOI":"10.1016\/0304-3975(93)90125-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"371-381","source":"Crossref","is-referenced-by-count":8,"title":["Exponential-time and subexponential-time sets"],"prefix":"10.1016","volume":"115","author":[{"given":"Shouwen","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tian","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90125-D_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01699457","article-title":"Bi-immune sets for complexity classes","volume":"18","author":"Balc\u00e1zar","year":"1986","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(93)90125-D_BIB2","volume":"Vols. I and II","author":"Balc\u00e1zar","year":"1988-1990"},{"key":"10.1016\/0304-3975(93)90125-D_BIB3","first-page":"225","article-title":"On the power of probabilistic polynomial time: PNP[log] \u2286 PP","author":"Beigel","year":"1989","journal-title":"Proc. 4th IEEE"},{"key":"10.1016\/0304-3975(93)90125-D_BIB4","first-page":"76","article-title":"On the structure of complete sets: almost everywhere complexity and infinitely often speed-up","author":"Berman","year":"1976","journal-title":"Proc. 17th FOCS"},{"key":"10.1016\/0304-3975(93)90125-D_BIB5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphism and density and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90125-D_BIB6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF02090397","article-title":"Completeness for nondeterministic classes","volume":"24","author":"Buhrman","year":"1991","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(93)90125-D_BIB7","series-title":"Proc. STACS '91","first-page":"410","article-title":"Bounded reductions","volume":"Vol. 480","author":"Buhrman","year":"1991"},{"key":"10.1016\/0304-3975(93)90125-D_BIB8","first-page":"224","article-title":"On truth-table reducibility to SAT and the difference hierarchy over NP","author":"Buss","year":"1990","journal-title":"Proc. 3rd IEEE"},{"key":"10.1016\/0304-3975(93)90125-D_BIB9","first-page":"240","article-title":"Complete problems and strong polynomial reducibilities. Theoretical aspects of computer science","volume":"Vol. 349","author":"Ganesan","year":"1990"},{"key":"10.1016\/0304-3975(93)90125-D_BIB10","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/S0019-9958(85)80004-8","article-title":"Sparse sets in NP \u2014 P: EXPTIME vs. NEXPTIME","volume":"65","author":"Hartmanis","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90125-D_BIB11","first-page":"3","article-title":"Structural properties of nondeterministic complete sets","author":"Homer","year":"1990","journal-title":"Proc. 5th IEEE SiCT"},{"key":"10.1016\/0304-3975(93)90125-D_BIB12","author":"Homer","year":"1990","journal-title":"A note on many\u2014one and 1-truth-table-complete set"},{"key":"10.1016\/0304-3975(93)90125-D_BIB13","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(93)90125-D_BIB14","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. ACM"},{"key":"10.1016\/0304-3975(93)90125-D_BIB15","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(93)90125-D_BIB16","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/S0019-9958(86)80024-9","article-title":"On the density and complexity of polynomial cores for intractables sets","volume":"70","author":"Orponen","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90125-D_BIB17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01704904","article-title":"Complete sets and closeness to complexity classes","volume":"19","author":"Sch\u00f6ning","year":"1986","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(93)90125-D_BIB18","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0304-3975(85)90218-X","article-title":"On one-one P-equivalence Relations","volume":"38","author":"Watanabe","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90125-D_BIB19","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390125D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390125D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:23:27Z","timestamp":1555129407000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390125D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["030439759390125D"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90125-d","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}