Advertisement

computational complexity

, Volume 21, Issue 4, pp 643–670 | Cite as

On the power of unambiguity in log-space

  • A. Pavan
  • Raghunath TewariEmail author
  • N. V. Vinodchandran
Article

Abstract

We report progress on the NL versus UL problem.
  • We show that counting the number of s-t paths in graphs where the number of s-v paths for any v is bounded by a polynomial can be done in FUL: the unambiguous log-space function class. Several new upper bounds follow from this including \({{{ReachFewL} \subseteq {UL}}}\) and \({{{LFew} \subseteq {UL}^{FewL}}}\)

  • We investigate the complexity of min-uniqueness—a central notion in studying the NL versus UL problem. In this regard we revisit the class OptL[log n] and introduce UOptL[log n], an unambiguous version of OptL[log n]. We investigate the relation between UOptL[log n] and other existing complexity classes.

  • We consider the unambiguous hierarchies over UL and UOptL[log n]. We show that the hierarchy over UOptL[log n] collapses. This implies that \({{{ULH} \subseteq {L}^{{promiseUL}}}}\) thus collapsing the UL hierarchy.

  • We show that the reachability problem over graphs embedded on 3 pages is complete for NL. This contrasts with the reachability problem over graphs embedded on 2 pages, which is log-space equivalent to the reachability problem in planar graphs and hence is in UL.

Keywords

Log-space complexity unambiguous computations graph reachability log-space optimization hardness 

Subject classification

68Q05 68Q10 68Q15 68Q17 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Allender & M. Ogihara (1994). Relationships among PL, #L, and the determinant. In Structure in Complexity Theory Conference, 1994., Proceedings of the Ninth Annual, 267–278.Google Scholar
  2. Eric Allender (1986). The complexity of sparse sets in P. In Proc. of the conference on Structure in complexity theory, 1–11. ISBN 0-387-16486-3.Google Scholar
  3. Eric Allender (2006) NL-printable sets and nondeterministic Kolmogorov complexity. Theor. Comput. Sci. 355(2): 127–138zbMATHCrossRefGoogle Scholar
  4. Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy (2009) Planar and Grid Graph Reachability Problems. Theory Comput. Syst. 45(4): 675–723MathSciNetzbMATHCrossRefGoogle Scholar
  5. Eric Allender, Robert Beals & Mitsunori Ogihara (1999a). The complexity of matrix rank and feasible systems of linear equations. Comput. Complex. 8, 99–126. ISSN 1016-3328. http://portal.acm.org/citation.cfm?id=329550.329552.
  6. Eric Allender, Klaus Reinhardt & Shiyu Zhou (1999b). Isolation, Matching, and Counting: Uniform and Nonuniform Upper Bounds. Journal of Computer and System Sciences 59, 164–181.MathSciNetzbMATHCrossRefGoogle Scholar
  7. Carme Àlvarez, Birgit Jenner (1993) A Very Hard Log-space Counting Class. Theoretical Computer Science 107: 3–30MathSciNetCrossRefGoogle Scholar
  8. Chris Bourke, Raghunath Tewari & N. V. Vinodchandran (2009). Directed Planar Reachability Is in Unambiguous Log-Space. ACM Trans. Comput. Theory 1(1), 1–17. ISSN 1942-3454.Google Scholar
  9. Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel (1992) Structure and Importance of Logspace-MOD Class. Mathematical Systems Theory 25(3): 223–237MathSciNetzbMATHCrossRefGoogle Scholar
  10. Gerhard Buntrock, Lane A. Hemachandra & Dirk Siefkes (1993). Using Inductive Counting to Simulate Nondeterministic Computation. Information and Computation 102(1), 102–117.Google Scholar
  11. Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange & Peter Rossmanith (1991). Unambiguity and fewness for logarithmic space. In Proceedings of the 8th International Conference on Fundamentals of Computation Theory (FCT’91), Volume 529 Lecture Notes in Computer Science, 168–179. Springer-Verlag.Google Scholar
  12. Jin-Yi Cai & Lane Hemachandra (1990). On the power of parity polynomial time. Mathematical Systems Theory.Google Scholar
  13. Michael L. Fredman, János Komlós & Endre Szemerédi (1984). Storing a Sparse Table with O(1) Worst Case Access Time. J. ACM 31(3), 538–544.Google Scholar
  14. Brady Garvin, Derrick Stolee, Raghunath Tewari & N. V. Vinodchandran (2011). ReachFewL=ReachUL. In 17th Annual International Computing and Combinatorics Conference.Google Scholar
  15. Hemachandra v (1989) The strong exponential hierarchy collapses. J. of Computer and System Sciences 39(3): 299–322MathSciNetzbMATHCrossRefGoogle Scholar
  16. Mark Krentel (1988) The complexity of optimization problems. J. of Computer and System Sciences 36: 490–509MathSciNetzbMATHCrossRefGoogle Scholar
  17. Jan Kynčl & Tomá š Vyskočil (2010). Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case. ACM Trans. Comput. Theory 1(3), 1–11. ISSN 1942-3454.Google Scholar
  18. Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar (2010). Longest Paths in Planar DAGs in Unambiguous Log-Space. Chicago Journal of Theoretical Computer Science 2010(8).Google Scholar
  19. M. Ogihara (1995). Equivalence of NC k and AC k-1 Closures of NP and Other Classes. Information and Computation 120(1), 55–58. ISSN 0890-5401. http://www.sciencedirect.com/science/article/B6WGK-45NJJWP-43/2/4fad4e8bff85772430de575c68b164aa
  20. Omer Reingold (2008). Undirected connectivity in log-space. J. ACM 55(4), 1–24. ISSN 0004-5411.Google Scholar
  21. Klaus Reinhardt & Eric Allender (2000). Making nondeterminism unambiguous. SIAM Journal of Computing 29, 1118–1131. An earlier version appeared in FOCS 1997, pp. 244–253.Google Scholar
  22. Uwe Schöning & Klaus Wagner (1988). Collapsing oracle hierarchies, census functions and logarithmically many queries. In STACS 88, Robert Cori & Martin Wirsing, editors, volume 294 of Lecture Notes in Computer Science, 91–97. Springer Berlin / Heidelberg. doi: 10.1007/BFb0035835.
  23. Till Tantau (2003). Logspace Optimisation Problems and their Approximation Properties. Technical Report TR03-077, Electronic Colloquium on Computational Complexity.Google Scholar
  24. Thomas Thierauf & Fabian Wagner (2010). The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace. Theor. Comp. Sys. 47, 655–673. ISSN 1432-4350. doi: 10.1007/s00224-009-9188-4.
  25. Thomas Thierauf & Fabin Wagner (2009). Reachability in K 3,3-free Graphs and K 5-free Graphs is in Unambiguous Log-Space. In 17th International Conference on Foundations of Computation Theory (FCT), Lecture Notes in Computer Science 5699, 323–334. Springer-Verlag.Google Scholar
  26. Leslie Valiant (1976) The Relative Complexity of Checking and Evaluating. Information Processing Letters 5: 20–23zbMATHCrossRefGoogle Scholar
  27. Avi Wigderson (1994). NL/poly \({{{\rm NL/poly} \subseteq \oplus{\rm L/poly}}}\) . In Proceedings of the 9th Structures in Complexity conference, 59–62.Google Scholar

Copyright information

© Springer Basel AG 2012

Authors and Affiliations

  • A. Pavan
    • 1
  • Raghunath Tewari
    • 2
    Email author
  • N. V. Vinodchandran
    • 3
  1. 1.Department of Computer ScienceIowa State UniversityAmesUSA
  2. 2.Department of Computer Science and EngineeringIndian Institute of Technology KanpurKanpurIndia
  3. 3.Department of Computer Science and EngineeringUniversity of Nebraska–LincolnLincolnUSA

Personalised recommendations