Jan 12, 2010 · We investigate the complexity of min-uniqueness - a central notion in studying the \NL vs \UL problem. We show that min-uniqueness is necessary and sufficient ...

Theorem 3.2 (Reinhardt & Allender 2000). There is an unambiguous non- deterministic log-space machine M that given a directed graph G and two vertices s and t ...

Jan 12, 2010 · In particular, they essentially showed that a logspace algorithm that transforms a directed graph into a min-unique graph with respect to the ...

Abstract. We report progress on the \NL vs \UL problem. [-] We show unconditionally that the complexity class $\ReachFewL\subseteq\UL$.

Sep 25, 2012 · We report progress on the NL versus UL problem. We show that counting the number of s-t paths in graphs where the number of s-v paths for ...

Abstract. We report progress on the NL versus UL problem. – We show that counting the number of s-t paths in graphs where the number of s-v paths for any v ...

We investigate the relation between UOptL[log n] and other existing complexity classes. We consider the unambiguous hierarchies over UL and UOptL[log n]. We ...

Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran: On the Power of Unambiguity in Logspace. Electron. Colloquium Comput. Complex. TR10 (2010).

We investigate the relation betweenUOptL[logn] and other existing complexity classes. We consider the unambiguous hierarchies overULandUOptL[logn]. We show that ...

Chris Bourke, Raghunath Tewari & N. V. Vinodchandran (2009). Directed Planar Reachability Is in Unambiguous Log-Space. ACM Trans. Comput. Theory 1(1), 1–17.