S-T connectivity on digraphs with a known stationary distribution

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2007, Pages 236-249

  Chung, Kai Min ^a   Reingold, Omer ^b   Vadhan, Salil ^a  

^a HARVARD UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTION EVALUATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING;

DETERMINISTIC LOGSPACE ALGORITHM; RANDOM WALK THEORY; RANDOMIZED LOGSPACE; STATIONARY DISTRIBUTION;

GRAPH THEORY;

EID: 34748881393     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2007.30     Document Type: Conference Paper

References (21)

1. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In 20th Annual Symposium on Foundations of Computer Science, pages 218-223, San Juan, Puerto Rico, 29-31 Oct. 1979. IEEE.
2. A. Amit, N. Linial, J. Matousek, and E. Rozenman. Random lifts of graphs. In SODA, pages 883-894, 2001.
3. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13(4):850-864, Nov. 1984.
4. K.-M. Chung, O. Reingold, and S. Vadhan. S-T connectivity on digraphs with a known stationary distribution. Electronic Colloquium on Computational Complexity Technical Report TR07-30, March 2007.
5. J. A. Fill. Eigenvalue bounds on convergence to stationarity for nonreversible markov chains with an application to the exclusion process. Annals of Applied Probability, 1:62-87, 1991.
6. I. Haitner, D. Harnik, and O. Reingold. On the power of the randomized iterate. In CRYPTO, pages 22-40, 2006.
7. R. Impagliazzo, V. Kabanets, and A. Wigderson. In search of an easy witness: exponential time vs. probabilistic polynomial time. Journal of Computer and System Sciences, 65(4):672-694, 2002.
8. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In 41st Annual Symposium on Foundations of Computer Science (Redondo Beach, CA, 2000), pages 189-197. IEEE Comput. Soc. Press, Los Alamitos, CA, 2000.
9. V. Kabanets and R. Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity, 13(1-2):1-46, 2004.
10. E. Kaplan, M. Naor, and O. Reingold. Derandomized constructions of k-wise (almost) independent permutations. In APPROX-RANDOM, pages 354-365,2005.
11. M. Mihail. Conductance and convergence of markov chains: a combinatorial treatment of expanders. In Proc. of the 37th Conf on Foundations of Computer Science, pages 526-531, 1989.
12. N. Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461,1992.
13. N. Nisan and A. Wigderson. Hardness vs randomness. Journal of Computer and System Sciences, 49(2):149-167, Oct. 1994.
14. R. Raz and O. Reingold. On recycling the randomness of the states in space bounded computation. In Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing, Atlanta, GA, May 1999.
15. O. Reingold. Undirected st-connectivity in logspace. In Proceedings of the 37th ACM Symposium on Theory of Computing, pages 376-385, 2005.
16. O. Reingold, L. Trevisan, and S. Vadhan. Pseudorandom walks in regular digraphs and the RL vs. L problem. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC '06), pages 457-466, 21-23 May 2006. Preliminary version on ECCC, February 2005.
17. hSPACE(S) ⊆ SPACE(S). Journal of Computer and System Sciences, 58(2):376-403, 1999. 36th IEEE Symposium on the Foundations of Computer Science (Milwaukee, WI, 1995).
18. A. Sinclair and M. Jerrum. Approximate counting, uniform generation and rapidly mixing Markov chains. Inform. and Comput., 82(1):93-133, 1989.
19. D. Sivakumar. Algorithmic derandomization via complexity theory. In Proceedings of the ThirtyFourth Annual ACM Symposium on Theory of Computing, pages 619-626 (electronic), New York, 2002. ACM.
20. V. Trifonov. An O(log n log log n) space algorithm for undirected st-connectivity. In STOC, pages 626-633, 2005.
21. A. C. Yao. Theory and applications of trapdoor functions (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science, pages 80-91, Chicago, Illinois, 3-5 Nov. 1982. IEEE.