{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T00:24:21Z","timestamp":1778804661847,"version":"3.51.4"},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"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,5]]},"DOI":"10.1016\/0304-3975(95)00167-0","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"361-370","source":"Crossref","is-referenced-by-count":13,"title":["Quasi-linear truth-table reductions to p-selective sets"],"prefix":"10.1016","volume":"158","author":[{"given":"M.","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Arvind","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00167-0_BIB1","series-title":"Proc. Structure in Complexity Theory Conf.","first-page":"24","article-title":"Polynomial time truth-table reductions to p-selective sets","author":"Agrawal","year":"1994"},{"key":"10.1016\/0304-3975(95)00167-0_BIB2","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0022-0000(90)90025-G","article-title":"Self-reducibility","volume":"41","author":"Balc\u00e1zar","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00167-0_BIB3","article-title":"NP-hard sets are p-superterse unless R = NP","author":"Beigel","year":"1988"},{"key":"10.1016\/0304-3975(95)00167-0_BIB4","series-title":"Proc. Structure in Complexity Theory Conf.","first-page":"12","article-title":"Approximable sets","author":"Beigel","year":"1994"},{"key":"10.1016\/0304-3975(95)00167-0_BIB5","series-title":"Proc. Structure in Complexity Theory Conf.","first-page":"44","article-title":"Selective self-reducible sets: a new characterization of P","author":"Buhrman","year":"1993"},{"key":"10.1016\/0304-3975(95)00167-0_BIB6","series-title":"Proc. of the Structure in Complexity Theory Conf.","first-page":"150","article-title":"On the structure of bounded queries to arbitrary NP sets","author":"Chang","year":"1989"},{"key":"10.1016\/0304-3975(95)00167-0_BIB7","series-title":"Proc. 5th Internat. Conf. on Computing and Information","first-page":"55","article-title":"Selectivity","author":"Hemachandra","year":"1993"},{"key":"10.1016\/0304-3975(95)00167-0_BIB8","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1090\/S0002-9947-1968-0220595-7","article-title":"Semi-recursive sets and positive reducibility","volume":"137","author":"Jockush","year":"1968","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(95)00167-0_BIB9","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(95)00167-0_BIB10","first-page":"191","article-title":"Turing machines that take advice","volume":"28","author":"Karp","year":"1982","journal-title":"Enseign. Math."},{"key":"10.1016\/0304-3975(95)00167-0_BIB11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(83)90013-2","article-title":"On self-reducibility and weak p-selectivity","volume":"26","author":"Ko","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00167-0_BIB12","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)00167-0_BIB13","series-title":"Proc. Structure in Complexity Theory Conf.","first-page":"118","article-title":"On the non-uniform complexity of the graph isomorphism problem","author":"Lozano","year":"1992"},{"key":"10.1016\/0304-3975(95)00167-0_BIB14","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(95)00167-0_BIB15","series-title":"Proc. Structure in Complexity Theory Conf.","first-page":"2","article-title":"Polynomial time membership comparable sets","author":"Ogihara","year":"1994"},{"key":"10.1016\/0304-3975(95)00167-0_BIB16","series-title":"Proc. Structure in Complexity Theory Conf.","first-page":"139","article-title":"On one-query self-reducible sets","author":"Ogiwara","year":"1991"},{"key":"10.1016\/0304-3975(95)00167-0_BIB17","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/0220030","article-title":"On polynomial-time bounded truth-table reducibility of NP sets to sparse sets","volume":"20","author":"Ogiwara","year":"1991","journal-title":"SIAM J. Compu."},{"key":"10.1016\/0304-3975(95)00167-0_BIB18","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01744288","article-title":"p-selective sets, tally languages, and the behavior of polynomial reducibilities on NP","volume":"13","author":"Selman","year":"1979","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(95)00167-0_BIB19","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/0022-0000(81)90068-4","article-title":"Some observations on NP real numbers and p-selective sets","volume":"23","author":"Selman","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00167-0_BIB20","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)00167-0_BIB21","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF02090391","article-title":"On polynomial-time truth-table reducibilities of intractable sets to p-selective sets","volume":"24","author":"Toda","year":"1991","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(95)00167-0_BIB22","series-title":"Proc. Symp. on Theoretical Aspects of Computer Science","first-page":"427","article-title":"On sets bounded truth-table reducible to p-selective sets","volume":"Vol. 775","author":"Thierauf","year":"1994"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001670?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001670?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:24:11Z","timestamp":1556508251000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001670"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0304397595001670"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00167-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}