Derandomization that is rarely wrong from short advice that is typically good

For every ∈ > 0, we present a deterministic log-space algorithm that correctly decides undirected graph connectivity on all but at most 2 n ∈ of the n- vertex graphs. The same holds for every problem in Symmetric Log-space (i.e., SL.

[1]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[2]  M. Rabin.  Probabilistic algorithm for testing primality , 1980 .

[3]  Valentine Kabanets.  Easiness Assumptions and Hardness Tests: Trading Time for Zero Error , 2001, J. Comput. Syst. Sci..

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

[5]  Amnon Ta-Shma.  Almost Optimal Dispersers , 2002, Comb..

[6]  Michael E. Saks,et al.  Discrepancy sets and pseudorandom generators for combinatorial rectangles , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[7]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[8]  Avi Wigderson,et al.  Randomness vs. time: de-randomization under a uniform assumption , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

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

[10]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[11]  Avi Wigderson,et al.  P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.

[12]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[13]  Noam Nisan,et al.  On Yao's XOR-Lemma , 1995, Electron. Colloquium Comput. Complex..

[14]  Endre Szemerédi,et al.  Undirected Connectivity in O(log ^1.5 n) Space , 1992, FOCS.

[15]  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.

[16]  Noam Nisan,et al.  Hardness vs Randomness , 1994, J. Comput. Syst. Sci..

[17]  V. Arvind,et al.  On Resource-Bounded Measure and Pseudorandomness , 1997, FSTTCS.

[18]  Volker Strassen,et al.  A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[19]  David Zuckerman,et al.  Randomness-optimal sampling, extractors, and constructive leader election , 1996, STOC '96.

[20]  Gary L. Miller,et al.  Riemann's Hypothesis and tests for primality , 1975, STOC.

[21]  Valentine Kabanets.  Easiness assumptions and hardness tests: trading time for zero error , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

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

[23]  D. A. Burgess.  On Character Sums and Primitive Roots , 1962 .

[24]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[25]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[26]  Luca Trevisan,et al.  Constructions of Near-Optimal Extractors Using Pseudo-Random Generators , 1998, Electron. Colloquium Comput. Complex..

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

[28]  Luca Trevisan,et al.  Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..

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

[30]  Vikraman Arvind,et al.  On pseudorandomness and resource-bounded measure , 2001, Theor. Comput. Sci..

[31]  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).

[32]  Dana Ron,et al.  Chinese remaindering with errors , 2000, IEEE Trans. Inf. Theory.

[33]  Leonard M. Adleman,et al.  Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).