Theoretical Computer ScienceVolume 86, Issue 2, 2 September 1991, Pages 267-275Separating the eraser Turing machine classes Le, NLe, co-NLe and PeAuthor links open overlay panelMatthias Krause, Christoph Meinel, Stephan WaackShow moreShareCitehttps://doi.org/10.1016/0304-3975(91)90021-SGet rights and contentUnder an Elsevier user licenseopen archiveAbstractBy means of exponential lower and polynomial upper bounds for read-once-only Ω-branching programs we separate the logarithmic space-bounded complexity classes Le, NLe, co-NLe and Pe for eraser Turing machines.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1991 Published by Elsevier B.V.