RUSPACE\((\log n)\subseteq \text{DSPACE}(\log^2n/\log \log n)\)
From MaRDI portal
Publication:1271273
DOI10.1007/S002240000102zbMath0910.68007OpenAlexW1992104669MaRDI QIDQ1271273
Eric W. Allender, Klaus-Joern Lange
Publication date: 18 February 1999
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002240000102
Related Items (3)
Depth-first search in directed planar graphs, revisited ⋮ The Space Complexity of k-Tree Isomorphism ⋮ \textsc{ReachFewL} = \textsc{ReachUL}
This page was built for publication: RUSPACE\((\log n)\subseteq \text{DSPACE}(\log^2n/\log \log n)\)
