Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > UL:
Reports tagged with UL:
TR09-024 | 26th February 2009
Raghav Kulkarni

On the Power of Isolation in Planar Structures

The purpose of this paper is to study the deterministic
{\em isolation} for certain structures in directed and undirected
planar graphs.
The motivation behind this work is a recent development on this topic. For example, \cite{btv07} isolate a directed path in planar graphs and
\cite{dkr08} isolate a perfect matching in ... more >>>


TR26-280 | 21st October 2026
Krishnamoorthy Dinesh, Chandana Sasidharan

Space Complexity of Reachability in Simple Path Graphs

One of the central questions in space complexity is whether nondeterministic logspace computations (NL) can be simulated in unambiguous logspace (UL). A stronger notion, reach unambiguity (RUL $\subseteq$ UL $\cap$ coUL), requires every configuration reachable from the start to have exactly one computation path (Buntrock et.al. 91). While directed graph ... more >>>




ISSN 1433-8092 | Imprint