Add to ORKGWe prove that the homeomorphism problem for 2 manifolds can be decided in logspace. The proof relies on Reingold's logspace solution to the undirected s, t-connectivity problem in graphs
Ever since Reingold’s deterministic logspace algorithm [66] for undirected graph reachability, logsp...
We present a logspace algorithm that constructs a canonical intersection model for a given proper ci...
In this paper we prove two results, one folklore and the other new. The folklore result, wh...
We prove that the homeomorphism problem for 2-manifolds can be decided in logspace. The proof relies...
Space complexity investigates the power and limitations of a computational model (e.g. a Turing mach...
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-conn...
Graph Isomorphism is the prime example of a computational problem with a wide difference between the...
We study the problem of space-efficient polynomial-time algorithms for {em directed st-connectivity}...
Part I. We make progress in understanding the complexity of the graph reachability problem in the co...
We give a deterministic O˜(log n)-space algorithm for approximately solving linear systems given by ...
A celebrated theorem of Savitch [Savitch'70] states that NSPACE(S) is contained in DSPACE(S²). In pa...
Savitch showed in 1970 that nondeterministic logspace (NL) is contained in deterministic O(log^2(n))...
This work presents a log-space reduction which compresses an n-vertex directed acyclic graph with m(...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
Abstract. In a previous work, Hofmann and Schöpp have introduced the pro-gramming language PURPLE t...
Ever since Reingold’s deterministic logspace algorithm [66] for undirected graph reachability, logsp...
We present a logspace algorithm that constructs a canonical intersection model for a given proper ci...
In this paper we prove two results, one folklore and the other new. The folklore result, wh...
We prove that the homeomorphism problem for 2-manifolds can be decided in logspace. The proof relies...
Space complexity investigates the power and limitations of a computational model (e.g. a Turing mach...
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-conn...
Graph Isomorphism is the prime example of a computational problem with a wide difference between the...
We study the problem of space-efficient polynomial-time algorithms for {em directed st-connectivity}...
Part I. We make progress in understanding the complexity of the graph reachability problem in the co...
We give a deterministic O˜(log n)-space algorithm for approximately solving linear systems given by ...
A celebrated theorem of Savitch [Savitch'70] states that NSPACE(S) is contained in DSPACE(S²). In pa...
Savitch showed in 1970 that nondeterministic logspace (NL) is contained in deterministic O(log^2(n))...
This work presents a log-space reduction which compresses an n-vertex directed acyclic graph with m(...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
Abstract. In a previous work, Hofmann and Schöpp have introduced the pro-gramming language PURPLE t...
Ever since Reingold’s deterministic logspace algorithm [66] for undirected graph reachability, logsp...
We present a logspace algorithm that constructs a canonical intersection model for a given proper ci...
In this paper we prove two results, one folklore and the other new. The folklore result, wh...