{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:56Z","timestamp":1761611156596},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Complexity"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1007\/bf01268143","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T03:03:06Z","timestamp":1111633386000},"page":"155-166","source":"Crossref","is-referenced-by-count":7,"title":["A note on logspace optimization"],"prefix":"10.1007","volume":"5","author":[{"given":"Carme","family":"\ufffdlvarez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Birgit","family":"Jenner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/BF01275489","volume":"3","author":"E. Allender","year":"1993","unstructured":"E. Allender, D. Bruschi, andG. Pighizzini, The complexity of computing maximal word functions.Comput complexity 3 (1993), 368?391.","journal-title":"Comput complexity"},{"issue":"1","key":"CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90252-O","volume":"107","author":"C. \ufffdlvarez","year":"1993","unstructured":"C. \ufffdlvarez andB. Jenner, A very hard log-space counting class.Theoret. Comput. Sci. 107:1 (1993), 3?30.","journal-title":"Theoret. Comput. Sci."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01191473","volume":"28","author":"C. \ufffdlvarez","year":"1995","unstructured":"C. \ufffdlvarez, J.L. Balc\ufffdzar, andB. Jenner, Adaptive logspace reducibility and parallel time.Math. Systems Theory 28 (1995), 117?140.","journal-title":"Math. Systems Theory"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"D.A. Barrington","year":"1989","unstructured":"D.A. Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages in NC1.J. Comput. System Sci. 38 (1989), 150?164.","journal-title":"J. Comput. System Sci."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"M. Beaudry and P. McKenzie, Circuits, matrices, and nonassociative computation.Proc. 7th Ann. IEEE Conf. Structure in Complexity Theory, 1992, 94?106.","DOI":"10.1109\/SCT.1992.215384"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1137\/0221006","volume":"21","author":"M. Ben-Or","year":"1992","unstructured":"M. Ben-Or andR. Cleve, Computing algebraic formulas using a constant number of registers.SIAM J. Comput. 21 (1992), 54?58.","journal-title":"SIAM J. Comput."},{"key":"CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-54458-5_60","volume-title":"Proc. 8th FCT Conf.","author":"D. Bruschi","year":"1991","unstructured":"D. Bruschi andG. Pighizzini, The complexity of computing maximal word functions.Proc. 8th FCT Conf., Lecture Notes in Computer Science529. Springer Verlag, Berlin, 1991, 157?167."},{"issue":"2","key":"CR8","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","volume":"13","author":"A.K. Chandra","year":"1984","unstructured":"A.K. Chandra, L. Stockmeyer, andU. Vishkin, Constant depth reducibility.SIAM J. Comput. 13:2 (1984), 423?439.","journal-title":"SIAM J. Comput."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S.A. Cook","year":"1985","unstructured":"S.A. Cook, A taxonomy of problems with fast parallel algorithms.Inform. and Control 64 (1985), 2?22.","journal-title":"Inform. and Control"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","volume":"8","author":"S. A. Cook","year":"1987","unstructured":"S. A. Cook andP. McKenzie, Problems complete for deterministic logarithmic space.J. Algorithms 8 (1987), 385?394.","journal-title":"J. Algorithms"},{"key":"CR11","unstructured":"C. Damm, DET=L#L?Informatik Preprint 8, Fachbereich Informatik der Humboldt-Universit\ufffdt zu Berlin, 1991."},{"issue":"5","key":"CR12","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","volume":"17","author":"N. Immerman","year":"1988","unstructured":"N. Immerman, Nondeterministic space is closed under complement.SIAM J. Comput. 17:5 (1988), 935?938.","journal-title":"SIAM J. Comput."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1006\/inco.1995.1007","volume":"116","author":"N. Immerman","year":"1995","unstructured":"N. Immerman andS. Landau, The complexity of iterated multiplication.Inform. and Comput. 116 (1995), 103?116.","journal-title":"Inform. and Comput."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1137\/0212037","volume":"12","author":"A. Selman","year":"1983","unstructured":"A., Selman, X. Mei-rui, andR. Book, Positive relativizations of complexity classes.SIAM J. Comput. 12 (1983), 565?579.","journal-title":"SIAM J. Comput."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","volume":"26","author":"R. Szelepcs\ufffdnyi","year":"1988","unstructured":"R. Szelepcs\ufffdnyi, The method of forced enumeration for nondeterministic automata.Acta Infor. 26 (1988), 279?284.","journal-title":"Acta Infor."},{"key":"CR16","unstructured":"S. Toda, Counting problems computationally equivalent to computing the determinant.Technical Report CSIM 91-07, Dept. Comp. Sci. and Info. Math., Univ. of Electro-Communications, Tokyo, May 1991."},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"V. Vinay, Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits.Proc. 6th Ann. IEEE Conf. Structure in Complexity Theory, 1991, 270?284.","DOI":"10.1109\/SCT.1991.160269"}],"container-title":["Computational Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01268143.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01268143\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01268143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:13:47Z","timestamp":1556648027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01268143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF01268143"],"URL":"https:\/\/doi.org\/10.1007\/bf01268143","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}