{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T14:17:14Z","timestamp":1774621034148,"version":"3.50.1"},"reference-count":32,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":7502,"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,1]]},"DOI":"10.1016\/0304-3975(93)90252-o","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:31:49Z","timestamp":1027654309000},"page":"3-30","source":"Crossref","is-referenced-by-count":110,"title":["A very hard log-space counting class"],"prefix":"10.1016","volume":"107","author":[{"given":"Carme","family":"\u00c1lvarez","sequence":"first","affiliation":[]},{"given":"Birgit","family":"Jenner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90252-O_BIB1","series-title":"Proc. 8th STACS","first-page":"422","article-title":"Functional oracle queries as a measure of parallel time","volume":"Vol. 480","author":"\u00c0lvarez","year":"1991"},{"key":"10.1016\/0304-3975(93)90252-O_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. ACM"},{"key":"10.1016\/0304-3975(93)90252-O_BIB3","series-title":"Proc. 4th STACS","first-page":"169","article-title":"Computing the counting function of context-free languages","volume":"Vol. 247","author":"Bertoni","year":"1987"},{"key":"10.1016\/0304-3975(93)90252-O_BIB4","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1137\/0218038","article-title":"Two applications of inductive counting for complementation problems","volume":"18","author":"Borodin","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90252-O_BIB5","first-page":"2","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(93)90252-O_BIB6","unstructured":"C. Damm, manuscript, 1991."},{"key":"10.1016\/0304-3975(93)90252-O_BIB7","series-title":"Proc. 17th ACM STOC","first-page":"59","article-title":"Compression and ranking","author":"Goldberg","year":"1985"},{"key":"10.1016\/0304-3975(93)90252-O_BIB8","series-title":"Complexity of Computation","first-page":"1","article-title":"The LBA problem and its importance in the theory of computing","volume":"Vol. 7","author":"Hartmanis","year":"1974"},{"key":"10.1016\/0304-3975(93)90252-O_BIB9","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1137\/0210027","article-title":"Languages simultaneously complete for one-way and two-way automata","volume":"10","author":"Hartmanis","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90252-O_BIB10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0022-0000(90)90038-M","article-title":"On the complexity of ranking","volume":"41","author":"Hemachandra","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90252-O_BIB11","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321495.321508","article-title":"Some results on tape-bounded Turing machines","volume":"16","author":"Hopcroft","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90252-O_BIB12","series-title":"Introduction on Automata Theory, Languages, and Computations","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(93)90252-O_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02090763","article-title":"The complexity of ranking simple languages","volume":"23","author":"Huynh","year":"1990","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(93)90252-O_BIB14","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complement","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90252-O_BIB15","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1051\/ita\/1989230100871","article-title":"Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata (extended version)","volume":"23","author":"Jenner","year":"1989","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/0304-3975(93)90252-O_BIB16","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","article-title":"Space-bounded reducibility among combinatorial problems","volume":"11","author":"Jones","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90252-O_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01683259","article-title":"New problems complete for nondeterministic log space","volume":"10","author":"Jones","year":"1976","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(93)90252-O_BIB18","series-title":"Doctoral dissertation (in German)","article-title":"Strukturelle Komplexit\u00e4t von Anzahlproblemen","author":"K\u00f6bler","year":"1989"},{"key":"10.1016\/0304-3975(93)90252-O_BIB19","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00276023","article-title":"On counting and approximation","volume":"26","author":"K\u00f6bler","year":"1989","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(93)90252-O_BIB20","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","article-title":"The complexity of optimization problems","volume":"36","author":"Krentel","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90252-O_BIB21","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1137\/0218073","article-title":"Polynomial space counting problems","volume":"18","author":"Ladner","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90252-O_BIB22","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01683260","article-title":"Relativization of questions about log space computability","volume":"10","author":"Ladner","year":"1976","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(93)90252-O_BIB23","series-title":"Proc. 11th MFCS","first-page":"378","article-title":"Nondeterministic log-space reductions","volume":"Vol. 176","author":"Lange","year":"1984"},{"key":"10.1016\/0304-3975(93)90252-O_BIB24","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90252-O_BIB25","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0022-0000(84)90066-7","article-title":"Space-bounded hierachies and probabilistic computation","volume":"28","author":"Ruzzo","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90252-O_BIB26","series-title":"Proc. 3rd Structure in Complexity Theory","first-page":"2","article-title":"The power of counting","author":"Sch\u00f6ning","year":"1988"},{"key":"10.1016\/0304-3975(93)90252-O_BIB27","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","article-title":"The method of forced enumeration for nondeterministic automata","volume":"26","author":"Szelepcs\u00e9nyi","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(93)90252-O_BIB28","series-title":"Proc. 30th IEEE FOCS","first-page":"514","article-title":"On the computational power of PP and \u2295P","author":"Toda","year":"1989"},{"key":"10.1016\/0304-3975(93)90252-O_BIB29","article-title":"On the power of #P functions, manuscript","author":"Toda","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90252-O_BIB30","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90252-O_BIB31","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(93)90252-O_BIB32","series-title":"Proc. 6th Structure in Complexity Theory","first-page":"270","article-title":"Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits","author":"Vinay","year":"1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390252O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390252O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T14:09:36Z","timestamp":1704204576000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390252O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["030439759390252O"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90252-o","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}