6 search results - page 1 / 2 » Realizable Paths and the NL vs L Problem |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
SIAMJO
2008
13 years 4 months ago
2008
A first order affine scaling method and two mth order affine scaling methods for solving monotone linear complementarity problems (LCP) are presented. All three methods produce ite...
MP
2008
13 years 4 months ago
2008
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
COCO
1998
Springer
13 years 8 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...