\textsc{ReachFewL} = \textsc{ReachUL}
DOI10.1007/S00037-012-0050-8zbMATH Open1366.68069OpenAlexW2786225953MaRDI QIDQ744612FDOQ744612
Authors: Brady Garvin, Derrick Stolee, Raghunath Tewari, 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
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Computational Complexity
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Structure and importance of logspace-MOD class
- Making Nondeterminism Unambiguous
- A very hard log-space counting class
- Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space
- Title not available (Why is that?)
- Isolation, matching, and counting uniform and nonuniform upper bounds
- Directed planar reachability is in unambiguous log-space
- Using inductive counting to simulate nondeterministic computation
- RUSPACE\((\log n)\subseteq \text{DSPACE}(\log^2n/\log \log n)\)
- On the power of unambiguity in log-space
- NL-printable sets and nondeterministic Kolmogorov complexity
- An unambiguous class possessing a complete set
Cited In (4)
This page was built for publication: \textsc{ReachFewL} = \textsc{ReachUL}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744612)
