{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:45Z","timestamp":1725456765330},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029633","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"385-391","source":"Crossref","is-referenced-by-count":6,"title":["Separating \u2295L from L, NL, co-NL and AL (=P) for Oblivious turing machines of linear access time"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Krause","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Alon,N.,W.Maass: Meanders, Ramsey theory and lower bounds for branching programs, Proc. 27th ACM STOC, 30\u201339, 1986.","DOI":"10.1109\/SFCS.1986.31"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Cai,J.,Hemachandra,L.: On the power of parity polynomial time, Proc. of STACS'89, Springer Verlag LNCS 349, 229\u2013239.","DOI":"10.1007\/BFb0028987"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Cobham, H.: The recognition problem for perfect squares, Proc.7-th IEEE Symp. on SWAT, 1966, 78\u201387.","DOI":"10.1109\/SWAT.1966.30"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Damm, C., Ch. Meinel: Seaparating completely complexity classes related to to polynomial size \u03a9-decision trees, Proc.FCT'89, LNCS 380, 127\u2013136.","DOI":"10.1007\/3-540-51498-8_12"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Immerman,N.: Nondeterministic space is closed under complement, Techn. Report 552, Yale University, 1987.","DOI":"10.1109\/SCT.1988.5270"},{"key":"42_CR6","first-page":"440","volume":"233","author":"S. Jukna","year":"1986","unstructured":"Jukna, S.. Lower bounds on the complexity of local circuits. Proc. MFCS'86 (1986), LNCS 233, 440\u2013448.","journal-title":"LNCS"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Krause,M.,Ch.Meinel,S.Waack: Separating the Eraser Turing machine classes L, NL, co-NL and P. Proc. MFCS'88, Lect.Notes in Comp.Sci.324, 405\u2013413, to appear in Theoretical Computer Science.","DOI":"10.1007\/BFb0017163"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Krause,M.,S.Waack,Ch.Meinel: Separating complexity classes related to certain input-oblivious logarithmic-space bounded Turing-machines.Proc. IEEE Structure in Complexity, Eugenie (U.S.A.), 1989.","DOI":"10.1109\/SCT.1989.41831"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Krause,M.,S.Waack:On oblivious branching programs of linear length Proc.FCT'89, LNCS 380, 287\u2013296, to appear in Information & Computation.","DOI":"10.1007\/3-540-51498-8_28"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Meinel,Ch. The power of polynomial size \u03a9-branching programs,Proc of STAC'88, Bourdeaux, LNCS 294, 81\u201390, to appear in Information & Computation.","DOI":"10.1007\/BFb0035834"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Papadimitriou,C.,S.Zachos: Two remarks on the power of counting. Proc. 6.GI Conf.on Theor.Computer Science,Springer Verlag, LNCS 145, 269\u2013276.","DOI":"10.1007\/BFb0009651"},{"issue":"3","key":"42_CR12","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0022-0000(81)90038-6","volume":"22","author":"W. Ruzzo","year":"1981","unstructured":"Ruzzo, W.: On uniform circuit complexity. J.of Comp. and System Science 22 (3), 236\u2013283, 1981.","journal-title":"J.of Comp. and System Science"},{"key":"42_CR13","first-page":"96","volume":"33","author":"R. Szelepcsenyi","year":"1987","unstructured":"Szelepcsenyi, R.: The method of forcing for nondeterministic automata, Bulletin of the EATCS 33, 1987, 96\u201399.","journal-title":"Bulletin of the EATCS"},{"key":"42_CR14","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/42282.46161","volume":"35","author":"I. Wegener","year":"1988","unstructured":"Wegener, I.: On the complexity of branching programs and decision trees for clique functions. Interner Bericht der Univ. Frankfurt, 1984, published in Journal of the ACM 35, 461\u2013471, 1988.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029633","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:15:42Z","timestamp":1586592942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029633"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0029633","relation":{},"subject":[]}}