Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > DETERMINISTIC TRANSITIVE CLOSURE LOGIC:
Reports tagged with Deterministic Transitive Closure Logic:
TR08-090 | 6th August 2008
Ulrich Schöpp, Martin Hofmann

Pointer Programs and Undirected Reachability

Revisions: 1

We study pointer programs as a model of structured computation within LOGSPACE. Pointer programs capture the common description of LOGSPACE algorithms as programs that take as input some structured data (e.g. a graph) and that store in memory only a constant number of pointers to the input (e.g. to the ... more >>>




ISSN 1433-8092 | Imprint