Undirected connectivity in log-space

Journal of the ACM

Volumn 55, Issue 4, 2008, Pages

  Reingold, Omer ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Bounded space algorithms; Derandomization; Pseudorandom generator

Indexed keywords

BOUNDED SPACE ALGORITHMS; DERANDOMIZATION; PSEUDORANDOM GENERATOR; SPACE COMPLEXITIES; UNDIRECTED GRAPHS;

CHLORINE COMPOUNDS;

EID: 52249087391     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1391289.1391291     Document Type: Article

References (54)

1. AJTAI, M., KOMLÓS, J., AND SZEMERÉDI, E. 1987. Deterministic simulation in LOGSPACE. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC) (New York, NY). ACM, New York, 132-140.
2. ALELIUNAS, R., KARP, R. M., LIPTON, R. J., LOVÁSZ, L., AND RACKOEF, C. 1979. Random walks, universal traversal sequences, and the complexity of maze problems. In Proceedings of the 20th Annual Symposium on Foundations of Computer Science (FOCS) (San Juan, Puerto Rico). IEEE Computer Society Press, Los Alamitos, CA, 218-223.
3. ALON, N. 1986. Eigenvalues and expanders. Combinatorica 6, 2, 83-96.
4. ALON, N., GALIL, Z., AND MILMAN, V. D. 1987. Better expanders and superconcentrators. J. Algorithms 8, 3, 337-347.
5. 1, isoperimetric inequalities for graphs, and superconcentrators. J. Combinat. Theory Ser. B 38, 1 73-88.
6. ALON, N., AND ROICHMAN, Y. 1994. Random Cayley graphs and expanders. Rand. Struct. Algorithms 5, 2, 271-284.
7. ALON, N., AND SUDAKOV, B. 2000. Bipartite subgraphs and the smallest eigenvalue. Combinat. Probab. Comput. 9, 1.
8. ALVAREZ, C., AND GREENLAW, R. 1996. A compendium of problems complete for symmetric logarithmic space. Electronic Colloquium on Computational Complexity (ECCC) 3, 039.
9. 4/3) space algorithm for (s,t) connectivity in undirected graphs. J. ACM 47, 2, 294-311.
10. BABAI, L., NISAN, N., AND SZEGEDY, M. 1989. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (Seattle, WA). ACM, New York, 204-232.
11. BEN-ASHER, Y., LANGE, K.J., PELEG, D., AND SCHUSTER, A. 1995. The complexity of reconfiguring network model. Inf. Comput. 21, 1, 41-58.
12. BORODIN, A., COOK, S. A., DYMOND, P. W., RUZZO, W. L., AND TOMPA, M. 1989. Two applications of inductive counting for complementation problems. SIAM J. Comput. (SICOMP) 18, 3, 559-578.
13. BRODER, A., AND SHAMIR, E. 1987. On the second eigenvalue of random regular graphs. In Poceedings of the 28th Annual Symposium on Foundations of Computer Science (FOCS) (Los Angeles, CA). IEEE Computer Society Press, Los Alamitos, CA, 286-294.
14. CHUNG, K.-M., REINGOLD, O., AND VADHAN, S. 2007. S-T connectivity on digraphs with known stationary distribution. In Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC), In IEEE Computer Society Press, Los Alamitos, CA, 236-249. (Full version posted as ECCC TR07-030).
15. DLNUR, I. 2007. The PCP Theorem by gap amplification. J. ACM 54, 3, 12.
16. FRIEDMAN, J. 1991. On the second eigenvalue and random walks in random, d-regular graphs. Combinatorica 11, 4, 331-362.
17. FRIEDMAN, J., KAHN, J., AND SZEMERÉDI, E. 1989. On the second eigenvalue in random regular graphs. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (Seattle, WA), ACM, New York, 587-598.
18. GABBER, O., AND GALIL, Z. 1981. Explicit constructions of linear-sized superconcentrators. J. Comput. Syst. Sci. 22, 3 (June), 407-420.
19. GOLDREICH, O. 2005. Bravely, moderately: A common theme in four recent results. Electronic Colloquium on Computational Complexity (ECCC) 098. (Also appeared as part of SIGACT news complexity theory column 51.)
20. GOLDREICH, O. 2008. Computational Complexity: A Conceptual Perspective. Cambridge University Press. (Online drafts at http://www.wisdom.weizmann.ac.il/oded/cc-drafts.html.)
21. GOLDREICH, O., AND WLGDERSON, A. 2002. Derandomization that is rarely wrong from short advice that is typically good. In Proceedings of the 6th International Workshop on Randomization and Computation (RANDOM). 209-223.
22. HOORY, S., AND WIGDERSON, A. 1993. Universal traversal sequences for expander graphs. Inf. Process. Lett. 46, 2, 67-69.
23. IMPAGLIAZZO, R., NLSAN, N., AND WIGDERSON, A. 1994. Pseudorandomness for network algorithms. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC) (Montréal, Québec, Canada). ACM, New York, 356-364.
24. JERRUM, M., SINCLAIR, A., AND VIGODA, E. 2004. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51, 4, 671-697.
25. JIMBO, S., AND MARUOKA, A. 1987. Expanders obtained from affine transformations. Combinatorica 7, 4, 343-355.
26. K.ARCHMER, M., AND WIGDERSON, A. 1993. On span programs. In Proceedings of the 8th Structures in Complexity conference. 102-111.
27. KLIVANS, A., AND VAN MELKEBEEK, D. 2002. Graph, nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Comput. (SICOMP) 31, 5, 1501-1526.
28. KOUCKY, M. 2001. Universal traversal sequences with backtracking. In Proceedings of the IEEE Conference on Computational Complexity (CCC). IEEE Computer Society Press, Los Alamitos, CA, 21-27.
29. KOUCKY, M. 2003. On traversal sequences, exploration sequences and completeness of kolmogorov random strings. Ph.D. dissertation, Rutgers University.
30. LEWIS, H. R., AND PAPADIMITRIOU, C. H. 1982. Symmetric space-bounded computation. Theoret. Comput. Sci. 19, 161-187.
31. LUBOTZKY, A., PHILLIPS, R., AND SARNAK, P. 1988. Ramanujan graphs. Combinatorica 8, 3, 261-277.
32. MADRAS, N., AND RANDALL, D. 1996. Factoring Markov chains to bound mixing rates. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA, 194-203.
33. MARGULIS, G. A. 1973. Explicit constructions of expanders. Problemy Peredachi Informatsii 9, 4, 71-80.
34. MARGULIS, G. A. 1988. Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators. Problemy Peredachi Informatsii 24, 1, 51-60.
35. MARTIN, R. A., AND RANDALL, D. 2000. Sampling adsorbing staircase walks using a new markov chain decomposition method. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS). (Redondo Beach, CA) IEEE Computer Society Press, Los Alamitos, CA, 492-502.
36. MORGENSTERN, M. 1994. Existence and explicit constructions of q + 1 regular Ramanujan graphs for every prime power q. J. Combinat. Theory Ser. B 62, 1, 44-62.
37. NISAN, N. 1992a. Pseudorandom generators for space-bounded computation. Combinatorica 12, 4, 449-461.
38. NISAN, N. 1992b. RL ⊆ SC. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC). ACM, New York, 619-623.
39. 1.5n) space. In Proceedings of the 30th Foundations of Computer Science (Research Triangle Park, NC), IEEE Computer Society Press, Los Alamitos, CA, 24-29.
40. NISAN, N., AND TA-SHMA, A. 1995. Symmetric logspace is closed under complement. Chicago J. Theor. Comput. sci.
41. NISAN, N., AND ZUCKERMAN, D. 1996. Randomness is linear in space. J. Comput. Syst. Sci. 52, 1 (Feb.), 43-52.
42. PINSKER, M. S. 1973. On the complexity of a concentrator. In Proceedings of the 7th Annual Teletraffic Conference. Stockholm, 318/1-318/4.
43. RAZ, R., AND REINGOLD, O. 1999. On recycling the randomness of the states in space bounded computation. In Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (STOC) (Atlanta, GA). ACM, New York.
44. REIF, J. H. 1984. Symmetric complementation. J. ACM 31, 2, 401-421.
45. REINGOLD, O., TREVISAN, L., AND VADHAN, S. P. 2006. Pseudorandom walks on regular digraphs and the RL vs. L Problem. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC). ACM, New York, 457-466.
46. REINGOLD, O., VADHAN, S., AND WIGDERSON, A. 2000. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS) (Redondo Beach, CA). IEEE Computer Society Press, Los Alamitos, CA, 3-13.
47. REINGOLD, O., VADHAN, S., AND WIGDERSON, A. 2002. Entropy waves, the zig-zag graph product, and new constant-degree expanders. Ann. Math. 155, 1 (January). (Extended abstract in Proceedings of FOCS '00).
48. ROZENMAN, E., AND VADHAN, S. 2005. Derandomized squaring of graphs. In Proceedings of the 8th International Workshop on Randomization and Computation (RANDOM). Lecture Notes in Computer Science, vol. 3624. Springer-Verlag, New York, 436-447.
49. SAKS, M. 1996. Randomization and derandomization in space-bounded computation. In Proceedings of the IEEE 11th Annual Conference on Structure in Complexity Theory. IEEE Computer Society Press, Los Alamitos, CA.
50. 3/2). J. Comput. Syst. Sci. 58, 2, 376-403.
51. SAVITCH, J. 1970. Relationship between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4, 2, 177-192.
52. TANNER, M. R. 1984. Explicit concentrators from generalized n-gons. SIAM J. Algeb. Disc. Meth. 5, 3, 287-293.
53. TRIFONOV, V. 2005. An o(log n log log n) space algorithm for undirected s,t-connectivity. In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC). ACM, New York.
54. WIGDERSON, A. 1992. The complexity of graph connectivity. In Proceedings of the 17th Mathematical Foundations of Computer Science. 112-132.