{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:17:41Z","timestamp":1778296661132,"version":"3.51.4"},"reference-count":23,"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)90025-g","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"367-388","source":"Crossref","is-referenced-by-count":42,"title":["Self-reducibility"],"prefix":"10.1016","volume":"41","author":[{"given":"Jos\u00e9L.","family":"Balc\u00e1zar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90025-G_BIB1","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(68)91087-5","article-title":"Time and tape complexity of pushdown automaton languages","volume":"13","author":"Aho","year":"1968","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(90)90025-G_BIB2","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1145\/5925.5937","article-title":"The polynomial time hierarchy and sparse oracles","volume":"33","author":"Balc\u00e1zar","year":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90025-G_BIB3","article-title":"Structural Complexity I","volume":"Vol. 11","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/0022-0000(90)90025-G_BIB4","unstructured":"J. L. Balc\u00e1zar and U. Sch\u00f6ning, \u201cLogarithmic Advice Classes,\u201d Report de recerca LSI-88-12, Univ. Polit\u00e8cnica de Catalunya, J. Theoret. Comp. Sci., to appear."},{"key":"10.1016\/0022-0000(90)90025-G_BIB5","series-title":"Int. Colloq. Automata, Languages, and Programming","first-page":"63","article-title":"Relationship between density and deterministic complexity of NP-complete languages","volume":"Vol. 62","author":"Berman","year":"1978"},{"key":"10.1016\/0022-0000(90)90025-G_BIB6","series-title":"Third Structure in Complexity Theory Conference","first-page":"116","article-title":"Two applications of complementation via inductive counting","author":"Borodin","year":"1988"},{"key":"10.1016\/0022-0000(90)90025-G_BIB7","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90025-G_BIB8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","article-title":"Characterizations of pushdown machines in terms of time bounded computers","volume":"18","author":"Cook","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90025-G_BIB9","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\/0022-0000(90)90025-G_BIB10","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1137\/0202025","article-title":"The hardest context-free language","volume":"2","author":"Greibach","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90025-G_BIB11","article-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0022-0000(90)90025-G_BIB12_1","series-title":"Third Structure in Complexity Theory Conference","first-page":"112","article-title":"Nondeterministic space is closed under complement","author":"Immerman","year":"1988"},{"key":"10.1016\/0022-0000(90)90025-G_BIB12_2","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90025-G_BIB13_1","series-title":"Proceedings, 12th ACM Symposium on Theory of Computing","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"issue":"2","key":"10.1016\/0022-0000(90)90025-G_BIB13_2","first-page":"191","article-title":"Turing machines that take advice","volume":"28","author":"Karp","year":"1982","journal-title":"Enseign. Math."},{"key":"10.1016\/0022-0000(90)90025-G_BIB14","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\/0022-0000(90)90025-G_BIB15","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","article-title":"The circuit value problem is logspace complete for P","author":"Ladner","year":"1975","journal-title":"SIGACT News"},{"key":"10.1016\/0022-0000(90)90025-G_BIB16","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 by Berman and Hartmanis","volume":"25","author":"Mahaney","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(90)90025-G_BIB17","series-title":"Studies in Complexity Theory","article-title":"Sparse sets and reducibilities","author":"Mahaney","year":"1986"},{"key":"10.1016\/0022-0000(90)90025-G_BIB18","article-title":"With what frequency are apparently intractable problems difficult?","author":"Meyer","year":"1979","journal-title":"M.I.T. Tech. Report TM-126"},{"key":"10.1016\/0022-0000(90)90025-G_BIB19","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0022-0000(84)90066-7","article-title":"Space-bounded hierarchies and probabilistic computations","volume":"28","author":"Ruzzo","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(90)90025-G_BIB20","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/322077.322083","article-title":"On the tape complexity of deterministic context-free languages","volume":"25","author":"Sudborough","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90025-G_BIB21","first-page":"96","article-title":"The method of forcing for nondeterministic automata","volume":"33","author":"Szelepc\u00e9nyi","year":"1987","journal-title":"Bull. EATCS"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090025G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090025G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:56:03Z","timestamp":1550307363000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090025G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["002200009090025G"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90025-g","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}