Pairwise Independence and Derandomization

This set of notes gives several applications of the following paradigm. The paradigm consists of two complementary parts. The first part is to design a probabilistic algorithm described by a sequence of random variables so that the analysis is valid assuming limited independence between the random variables. The second part is the design of a small probability space for the random variables such that they are somewhat independent of each other. Thus, the analysis of the algorithm holds even when the random variables used by the algorithm are generated according to the small space.

[1]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[2]  Michael Sipser,et al.  Expanders, Randomness, or Time versus Space , 1988, Journal of computer and system sciences (Print).

[3]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[4]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[5]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[6]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

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

[8]  Noam Nisan,et al.  More deterministic simulation in logspace , 1993, STOC.

[9]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[10]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[11]  Avi Wigderson,et al.  Dispersers, deterministic amplification, and weak random sources , 1989, 30th Annual Symposium on Foundations of Computer Science.

[12]  Richard M. Karp,et al.  Monte-Carlo Approximation Algorithms for Enumeration Problems , 1989, J. Algorithms.

[13]  M. Murty Ramanujan Graphs , 1965 .

[14]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[15]  Noam Nisan,et al.  Pseudorandom bits for constant depth circuits , 1991, Comb..

[16]  D. Sivakumar Algorithmic derandomization via complexity theory , 2002, STOC '02.

[17]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[18]  J. Håstad Computational limitations of small-depth circuits , 1987 .

[19]  Marek Karpinski,et al.  Approximating the number of zeroes of a GF[2] polynomial , 1991, SODA '91.

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

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

[22]  Leonid A. Levin,et al.  A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..

[23]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

[24]  Oded Goldreich,et al.  On the power of two-point based sampling , 1989, J. Complex..

[25]  Richard M. Karp,et al.  Monte-Carlo algorithms for the planar multiterminal network reliability problem , 1985, J. Complex..

[26]  Andrew Chi-Chih Yao,et al.  Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.

[27]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[28]  李幼升,et al.  Ph , 1989 .

[29]  John Gill,et al.  Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

[30]  Michael Sipser,et al.  Expanders, Randomness, or Time versus Space , 1988, J. Comput. Syst. Sci..

[31]  Aviad Cohen Avi Wigderson Dispersers , Deterministic Ampli cation , and Weak RandomSources , 1989 .

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

[33]  A. Yao Separating the polynomial-time hierarchy by oracles , 1985 .

[34]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[35]  Oded Goldreich,et al.  RSA and Rabin Functions: Certain Parts are as Hard as the Whole , 1988, SIAM J. Comput..

[36]  Johan Hstad,et al.  Construction of a pseudo-random generator from any one-way function , 1989 .

[37]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[38]  Eitan M. Gurari,et al.  Introduction to the theory of computation , 1989 .

[39]  Jin-Yi Cai,et al.  With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy , 1986, STOC '86.

[40]  Leonid A. Levin,et al.  Pseudo-random generation from one-way functions , 1989, STOC '89.

[41]  Michael Sipser,et al.  A complexity theoretic approach to randomness , 1983, STOC.

[42]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

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

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

[45]  Alexander Lubotzky,et al.  Explicit expanders and the Ramanujan conjectures , 1986, STOC '86.

[46]  Shafi Goldwasser,et al.  Private coins versus public coins in interactive proof systems , 1986, STOC '86.

[47]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..