Undirected connectivity in log-space

We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4/3(ṡ) obtained by Armoni, Ta-Shma, Wigderson and Zhou (JACM 2000). As undirected st-connectivity is complete for the class of problems solvable by symmetric, nondeterministic, log-space computations (the class SL), this algorithm implies that SL = L (where L is the class of problems solvable by deterministic log-space computations). Independent of our work (and using different techniques), Trifonov (STOC 2005) has presented an O(log n log log n)-space, deterministic algorithm for undirected st-connectivity. Our algorithm also implies a way to construct in log-space a fixed sequence of directions that guides a deterministic walk through all of the vertices of any connected graph. Specifically, we give log-space constructible universal-traversal sequences for graphs with restricted labeling and log-space constructible universal-exploration sequences for general graphs.

[1]  Omer Reingold,et al.  S-T Connectivity on Digraphs with a Known Stationary Distribution , 2007, Computational Complexity Conference.

[2]  A. Wigderson,et al.  ENTROPY WAVES, THE ZIG-ZAG GRAPH PRODUCT, AND NEW CONSTANT-DEGREE , 2004, math/0406038.

[3]  M. Pinsker,et al.  On the complexity of a concentrator , 1973 .

[4]  Avi Wigderson,et al.  Universal Traversal Sequences for Expander Graphs , 1993, Inf. Process. Lett..

[5]  Noam Nisan,et al.  Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..

[6]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computation , 1992, Comb..

[7]  Endre Szemerédi,et al.  Undirected Connectivity in O(l~gl*~ n) Space* , 1992 .

[8]  Noam Nisan,et al.  Symmetric logspace is closed under complement , 1995, STOC '95.

[9]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[10]  David Peleg,et al.  The Complexity of Reconfiguring Network Models , 1992, Inf. Comput..

[11]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

[12]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[13]  Avi Wigderson,et al.  Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[14]  Irit Dinur,et al.  The PCP theorem by gap amplification , 2006, STOC.

[15]  Noam Nisan,et al.  Pseudorandomness for network algorithms , 1994, STOC '94.

[16]  Endre Szemerédi,et al.  On the second eigenvalue of random regular graphs , 1989, STOC '89.

[17]  Ran Raz,et al.  On recycling the randomness of states in space bounded computation , 1999, STOC '99.

[18]  Noga Alon,et al.  Better Expanders and Superconcentrators , 1987, J. Algorithms.

[19]  N. Alon,et al.  il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .

[20]  Noam Nisan,et al.  RL⊆SC , 1992, STOC '92.

[21]  Vladimir Trifonov.  An O(log n log log n) space algorithm for undirected st-connectivity , 2005, STOC '05.

[22]  Lane A. Hemaspaandra,et al.  SIGACT news complexity theory column 51 , 2006, SIGA.

[23]  Salil P. Vadhan,et al.  Derandomized Squaring of Graphs , 2005, APPROX-RANDOM.

[24]  BPHSPACE ( S ) DSPACE ( S 3 2 ) * , 1999 .

[25]  Omer Reingold,et al.  S-T Connectivity on Digraphs with a Known Stationary Distribution , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[26]  Noam Nisan,et al.  Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..

[27]  Luca Trevisan,et al.  Pseudorandom walks on regular digraphs and the RL vs. L problem , 2006, STOC '06.

[28]  Michal Koucký,et al.  Universal traversal sequences with backtracking , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[29]  Moshe Morgenstern,et al.  Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q , 1994, J. Comb. Theory, Ser. B.

[30]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[31]  Akira Maruoka,et al.  Expanders obtained from affine transformations , 1987, Comb..

[32]  Avi Wigderson,et al.  Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing , 1992, Symposium on the Theory of Computing.

[33]  E. Szemerédi,et al.  Undirected connectivity in O(log/sup 1.5/n) space , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[34]  Noga Alon,et al.  Random Cayley Graphs and Expanders , 1994, Random Struct. Algorithms.

[35]  Allan Borodin,et al.  Two Applications of Inductive Counting for Complementation Problems , 1989, SIAM J. Comput..

[36]  Omer Reingold,et al.  Undirected ST-connectivity in log-space , 2005, STOC '05.

[37]  Avi Wigderson,et al.  An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs , 2000, JACM.

[38]  Eric Allender,et al.  On traversal sequences, exploration sequences and completeness of kolmogorov random strings , 2003 .

[39]  Avi Wigderson,et al.  Derandomization that is rarely wrong from short advice that is typically good , 2002, Electron. Colloquium Comput. Complex..

[40]  Christos H. Papadimitriou,et al.  Symmetric Space-Bounded Computation , 1982, Theor. Comput. Sci..

[41]  R. M. Tanner.  Explicit Concentrators from Generalized N-Gons , 1984 .

[42]  Avi Wigderson,et al.  The Complexity of Graph Connectivity , 1992, MFCS.

[43]  Dieter van Melkebeek,et al.  Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses , 1999, STOC '99.

[44]  Noga Alon,et al.  Bipartite Subgraphs and the Smallest Eigenvalue , 2000, Combinatorics, Probability and Computing.

[45]  M. Murty.  Ramanujan Graphs , 1965 .

[46]  Joel Friedman,et al.  On the second eigenvalue and random walks in randomd-regular graphs , 1991, Comb..

[47]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computations , 1990, STOC '90.

[48]  Dieter van Melkebeek,et al.  Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses , 2002, SIAM J. Comput..

[49]  János Komlós,et al.  Deterministic simulation in LOGSPACE , 1987, STOC.

[50]  Avi Wigderson,et al.  On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[51]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[52]  Michael E. Saks.  Randomization and derandomization in space-bounded computation , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[53]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[54]  Andrei Z. Broder,et al.  On the second eigenvalue of random regular graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[55]  Oded Goldreich.  Bravely, Moderately: A Common Theme in Four Recent Results , 2005, Electron. Colloquium Comput. Complex..

[56]  N. Madras,et al.  Factoring graphs to bound mixing rates , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[57]  Oded Goldreich,et al.  Computational complexity: a conceptual perspective , 2008, SIGA.

[58]  Dana Randall,et al.  Sampling adsorbing staircase walks using a new Markov chain decomposition method , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[59]  Michael Saks,et al.  BP H SPACE(S)⊆DSPACE(S 3/2 ) , 1999, FOCS 1999.

[60]  Carme Àlvarez,et al.  A compendium of problems complete for symmetric logarithmic space , 2000, computational complexity.

[61]  Akira Maruoka,et al.  Expanders obtained from affine transformations , 1985, STOC '85.