\textsc{ReachFewL} = \textsc{ReachUL}
From MaRDI portal
Publication:744612
Recommendations
Cites work
- scientific article; zbMATH DE number 1346519 (Why is no real title available?)
- A very hard log-space counting class
- An unambiguous class possessing a complete set
- Computational Complexity
- Directed planar reachability is in unambiguous log-space
- Isolation, matching, and counting uniform and nonuniform upper bounds
- Making Nondeterminism Unambiguous
- NL-printable sets and nondeterministic Kolmogorov complexity
- On the power of unambiguity in log-space
- RUSPACE\((\log n)\subseteq \text{DSPACE}(\log^2n/\log \log n)\)
- 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
- Using inductive counting to simulate nondeterministic computation
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)