Improved Algorithms via Approximations of Probability Distributions

We present two techniques for constructing sample spaces that approximate probability distributions. The first is a simple method for constructing the small-bias probability spaces introduced by Naor and Naor. We show how to efficiently combine this construction with the method of conditional probabilities to yield improved parallel algorithms for problems such as set discrepancy, finding large cuts in graphs, and finding large acyclic subgraphs. The second is a construction of small probability spaces approximating general independent distributions which are of smaller size than the constructions of Even, Goldreich, Luby, Nisan, and Veli?kovi?.

[1]  Avi Wigderson,et al.  SL ⊆L4/3 , 1997, STOC 1997.

[2]  Moni Naor,et al.  The Probabilistic Method Yields Deterministic Parallel Algorithms , 1994, J. Comput. Syst. Sci..

[3]  Anne Berger Bonnie.  Using randomness to design efficient deterministic algorithms , 1990 .

[4]  Aravind Srinivasan,et al.  Approximating Hyper-Rectangles: Learning and Pseudorandom Sets , 1998, J. Comput. Syst. Sci..

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

[6]  Alan M. Ferrenberg,et al.  Monte Carlo simulations: Hidden errors from "good" random number generators. , 1992, Physical review letters.

[7]  Oded Goldreich,et al.  RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure , 1984, FOCS.

[8]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[9]  Edgar A. Ramos,et al.  Solving Some Discrepancy Problems in NC , 1997, Algorithmica.

[10]  Aravind Srinivasan,et al.  The local nature of Δ-coloring and its algorithmic applications , 1995, Comb..

[11]  Tsan-Sheng Hsu,et al.  Graph augmentation and related problems: theory and practice , 1993 .

[12]  Aravind Srinivasan,et al.  Chernoff-Hoeffding bounds for applications with limited independence , 1995, SODA '93.

[13]  Noga Alon,et al.  Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.

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

[15]  Richard M. Karp,et al.  A fast parallel algorithm for the maximal independent set problem , 1985, JACM.

[16]  Noam Nisan.  Extracting randomness: how and why , 1996 .

[17]  Bernard Chazelle,et al.  On linear-time deterministic algorithms for optimization problems in fixed dimension , 1996, SODA '93.

[18]  Tsan-sheng Hsu,et al.  Parallel implementation of algorithms for finding connected components in graphs , 1994, Parallel Algorithms.

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

[20]  Noga Alon,et al.  Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.

[21]  Prabhakar Raghavan,et al.  Randomized algorithms and pseudorandom numbers , 1993, JACM.

[22]  Noam Nisan,et al.  Undirected connectivity in o(\log1 , 1989 .

[23]  Bonnie Berger,et al.  The fourth moment method , 1991, SODA '91.

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

[25]  A. Joffe.  On a Set of Almost Deterministic $k$-Independent Random Variables , 1974 .

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

[27]  Noam Nisan,et al.  Velickovic approximations of general independent distributions , 1992, Symposium on the Theory of Computing.

[28]  Moni Naor,et al.  Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..

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

[30]  J. Beck,et al.  Irregularities of distribution , 1987 .

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

[32]  Noam Nisan,et al.  Approximations of general independent distributions , 1992, STOC '92.

[33]  Aravind Srinivasan,et al.  Improved Parallel Approximation of a Class of Integer Programming Programming Problems , 1996, ICALP.

[34]  Joel H. Spencer,et al.  Balancing vectors in the max norm , 1986, Comb..

[35]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

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

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

[38]  Aravind Srinivasan,et al.  Approximating hyper-rectangles: learning and pseudo-random sets , 1997, STOC '97.

[39]  Bonnie Berger,et al.  Simulating (logcn)-wise independence in NC , 1991, JACM.

[40]  Oded Goldreich,et al.  The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[41]  Bonnie Berger,et al.  Tight Bounds for the Maximum Acyclic Subgraph Problem , 1997, J. Algorithms.

[42]  Michael Luby.  Removing Randomness in Parallel Computation without a Processor Penalty , 1993, J. Comput. Syst. Sci..

[43]  Bonnie Berger,et al.  Approximation alogorithms for the maximum acyclic subgraph problem , 1990, SODA '90.

[44]  Yijie Han.  A Fast Derandomization Scheme and Its Applications , 1996, SIAM J. Comput..

[45]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.