Pages that link to "Item:Q1926109"
From MaRDI portal
The following pages link to On the power of unambiguity in log-space (Q1926109):
Displaying 8 items.
- \textsc{ReachFewL} = \textsc{ReachUL} (Q744612) (← links)
- Division in logspace-uniform NC (Q2773023) (← links)
- Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space (Q2978550) (← links)
- Making Nondeterminism Unambiguous (Q4943859) (← links)
- Compressed Decision Problems in Hyperbolic Groups. (Q5090484) (← links)
- (Q5092325) (← links)
- Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)
- Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata (Q6173104) (← links)