Anant Dhayal
Abstract
For a graph G(V, E) (|V| = n) and a vertex s ∈ V, a weighting scheme (W : E ↦ Z+) is called a min-unique (resp. max-unique) weighting scheme if, for any vertex v of the graph G, there is a unique path of minimum (resp. maximum) weight from s to v, where weight of a path is the sum of the weights assigned to the edges. Instead, if the number of paths of minimum (resp. maximum) weight is bounded by nc for some constant c, then the weighting scheme is called a min-poly (resp. max-poly) weighting scheme.
In this article, we propose an unambiguous nondeterministic log-space (UL) algorithm for the problem of testing reachability graphs augmented with a min-poly weighting scheme. This improves the result in Reinhardt and Allender [2000], in which a UL algorithm was given for the case when the weighting scheme is min-unique.
Our main technique involves triple inductive counting and generalizes the techniques of Immerman [1988], Szelepcsényi [1988], and Reinhardt and Allender [2000], combined with a hashing technique due to Fredman et al. [1984] (also used in Garvin et al. [2014]). We combine this with a complementary unambiguous verification method to give the desired UL algorithm.
At the other end of the spectrum, we propose a UL algorithm for testing reachability in layered DAGs augmented with max-poly weighting schemes. To achieve this, we first reduce reachability in layered DAGs to the longest path problem for DAGs with a unique source, such that the reduction also preserves the max-unique and max-poly properties of the graph. Using our techniques, we generalize the double inductive counting method in Limaye et al. [2009], in which the UL algorithm was given for the longest path problem on DAGs with a unique sink and augmented with a max-unique weighting scheme.
An important consequence of our results is that, to show NL = UL, it suffices to design log-space computable min-poly (or max-poly) weighting schemes for layered DAGs.
- Eric Allender. 2007. Reachability problems: An update. In Proceedings of Computability in Europe. 25--27.Google Scholar
Digital Library
- Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, and Sambuddha Roy. 2009. Planar and grid graph reachability problems. Theory of Computing Systems 45, 4, 675--723. DOI:https://doi.org/10.1007/s00224-009-9172-zGoogle ScholarDigital Library
- Sanjeev Arora and Boaz Barak. 2009. Computational Complexity: A Modern Approach (1st ed.). Cambridge University Press, New York, NY. Google ScholarCross Ref
- A. Bondy and U. S. R. Murty. 2007. Graph Theory. Springer London.Google Scholar
- Chris Bourke, Raghunath Tewari, and N. V. Vinodchandran. 2009. Directed planar reachability is in unambiguous log-space. ACM Transactions on Computation Theory 1, 1, Article 4, 17 pages. DOI:https://doi.org/10.1145/1490270.1490274Google ScholarDigital Library
- Michael L. Fredman, János Komlós, and Endre Szemerédi. 1984. Storing a sparse table with 0(1) worst case access time. Journal of the ACM 31, 3, 538--544. DOI:https://doi.org/10.1145/828.1884Google ScholarDigital Library
- Brady Garvin, Derrick Stolee, Raghunath Tewari, and N. V. Vinodchandran. 2014. ReachFewL = ReachUL. Computational Complexity 23, 1, 85--98. DOI:https://doi.org/10.1007/s00037-012-0050-8Google ScholarDigital Library
- Neil Immerman. 1988. Nondeterministic space is closed under complementation. SIAM Journal of Computing 17, 5, 935--938. DOI:https://doi.org/10.1137/0217058Google ScholarDigital Library
- Nutan Limaye, Meena Mahajan, and Prajakta Nimbhorkar. 2009. Longest paths in planar DAGs in unambiguous logspace. In Proceedings of Computing: The Australasian Theory Symposium (CATS’09), 101--108.Google Scholar
- Aduri Pavan, Raghunath Tewari, and N. V. Vinodchandran. 2012. On the power of unambiguity in log-space. Computational Complexity 21, 4, 643--670. Google ScholarCross Ref
- Omer Reingold. 2005. Undirected ST-connectivity in log-space. In Proceedings of Symposium of Theory of Computing. 376--385. Google ScholarDigital Library
- Klaus Reinhardt and Eric Allender. 2000. Making nondeterminism unambiguous. SIAM Journal of Computing 29, 4, 1118--1131. Google ScholarDigital Library
- R. Szelepcsényi. 1988. The method of forced enumeration for nondeterministic automata. Acta Informatica 26, 3, 279--284. DOI:https://doi.org/10.1007/BF00299636Google ScholarDigital Library
Index Terms
- Min/Max-Poly Weighting Schemes and the NL versus UL Problem
Recommendations
Two-Way Automata Characterizations of L/poly Versus NL
Let L/p o l y and N L be the standard complexity classes, of languages recognizable in logarithmic space by Turing machines which are deterministic with polynomially-long advice and nondeterministic without advice, respectively. We recast the question ...
Longest paths in planar DAGs in unambiguous logspace
CATS '09: Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94Reachability and distance computation are known to be NL-complete in general graphs, but within UL ∩ co-UL if the graphs are planar. However, finding longest paths is known to be NP-complete, even for planar graphs. We show that with the combination of ...
NL-printable sets and nondeterministic Kolmogorov complexity
Logic, language, information and computationP-printable sets were defined by Hartmanis and Yesha and have been investigated by several researchers. The analogous notion of L-printable sets was defined by Fortnow et al.; both P-printability and L-printability were shown to be related to notions of ...
Comments