{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:30Z","timestamp":1725663630064},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565031"},{"type":"electronic","value":"9783540475743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:15:49Z","timestamp":1330254949000},"page":"16-27","source":"Crossref","is-referenced-by-count":5,"title":["Separating the lower levels of the sublogarithmic space hierarchy"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"first","affiliation":[]},{"given":"R\u00fcdiger","family":"Reischuk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0020-0190(92)90127-H","volume":"42","author":"H. Alt","year":"1992","unstructured":"H. Alt, V. Geffert, and K. Mehlhorn, A lower bound for the nondeterministic space complexity of context-free recognition, IPL 42, 1992, 25\u201327.","journal-title":"IPL"},{"key":"4_CR2","unstructured":"H. Alt, and K. Mehlhorn, Lower bounds for the space complexity of context free recognition, Proc. 3. ICALP, 1976, 339\u2013354."},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(87)90085-8","volume":"25","author":"J. Chang","year":"1987","unstructured":"J. Chang, O. Ibarra, B. Ravikumar, and L. Berman, Some observations concerning alternating Turing machines using small space, IPL 25, 1987, 1\u20139.","journal-title":"IPL"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1137\/0220031","volume":"20","author":"V. Geffert","year":"1991","unstructured":"V. Geffert, Nondeterministic computations in sublogarithmic space and space constructability, SIAM J. Comput., 20, 1991, 484\u2013498.","journal-title":"SIAM J. Comput."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"V. Geffert, Sublogarithmic \u03a32-space is not closed under complement and other separation results, Technical Report, University of Safarik, 1992.","DOI":"10.1051\/ita\/1993270403491"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"J. Hartmanis, and D. Ranjan, Space bounded computations: review and new separation results, Proc. 14. MFCS, 1989, 46\u201366 (also TCS 80, 1991, 289\u2013302).","DOI":"10.1016\/0304-3975(91)90391-E"},{"key":"4_CR7","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 complementation, SIAM J. Comput., 17, 1988, 935\u2013938.","journal-title":"SIAM J. Comput."},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(92)90151-5","volume":"101","author":"P. Michel","year":"1992","unstructured":"P. Michel, A survey of space complexity, TCS 101, 1992, 99\u2013132.","journal-title":"TCS"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0304-3975(80)90053-5","volume":"10","author":"M. Sipser","year":"1980","unstructured":"M. Sipser, Halting space-bounded computations, TCS 10, 1980, 335\u2013338.","journal-title":"TCS"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"R. Stearns, J. Hartmanis, and P. Lewis, Hierarchies of memory limited computations, Proc. IEEE Conf. on Switching Circuit Theory and Logical Design, 1965, 179\u2013190.","DOI":"10.1109\/FOCS.1965.11"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","volume":"26","author":"R. Szel\u00e9pcsenyi","year":"1988","unstructured":"R. Szel\u00e9pcsenyi, The method of forced enumeration for nondeterministic automata, Acta Informatica, 26, 1988, 279\u2013284.","journal-title":"Acta Informatica"},{"key":"4_CR12","unstructured":"A. Szepietowski, Turing machines with sublogarithmic space, unpubl. manuscript."},{"key":"4_CR13","unstructured":"K. Wagner, and G. Wechsung, Computational Complexity, Reidel, 1986."}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:04:21Z","timestamp":1605647061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}