6 search results - page 2 / 2 » Realizable Paths and the NL vs L Problem |
COCO
2010
Springer
13 years 8 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...