\textsc{ReachFewL} = \textsc{ReachUL}
From MaRDI portal
Publication:744612
DOI10.1007/s00037-012-0050-8zbMath1366.68069OpenAlexW2786225953MaRDI QIDQ744612
Brady Garvin, Raghunath Tewari, Derrick Stolee, N. V. Vinodchandran
Publication date: 25 September 2014
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-012-0050-8
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Using inductive counting to simulate nondeterministic computation
- A very hard log-space counting class
- RUSPACE\((\log n)\subseteq \text{DSPACE}(\log^2n/\log \log n)\)
- On the power of unambiguity in log-space
- Isolation, matching, and counting uniform and nonuniform upper bounds
- NL-printable sets and nondeterministic Kolmogorov complexity
- Directed Planar Reachability Is in Unambiguous Log-Space
- Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Structure and importance of logspace-MOD class
- Making Nondeterminism Unambiguous
- An unambiguous class possessing a complete set
- Computational Complexity
This page was built for publication: \textsc{ReachFewL} = \textsc{ReachUL}
