(De)randomized Construction of Small Sample Spaces in NC

Koller and Megiddo introduced the paradigm of constructing compact distributions that satisfy a given set of constraints and showed how it can be used to efficiently derandomize certain types of algorithms. In this paper, we significantly extend their results in two ways. First, we show how their approach can be applied to deal with more generalexpectation constraints. More importantly, we provide the firstparallel(NC) algorithm for constructing a compact distribution that satisfies the constraints up to a smallrelativeerror. This algorithm deals with constraints over any event that can be verified by finite automata, including allindependence constraintsas well as constraints over events relating to the parity or sum of a certain set of variables. Our construction relies on a new and independently interesting parallel algorithm for converting a solution to a linear system into an almost basic approximate solution to the same system. We use these techniques in the first NC derandomization of an algorithm for constructing large independent sets ind-uniform hypergraphs forarbitrary d. We also show how the linear programming perspective suggests new proof techniques which might be useful in general probabilistic analysis.

[1]  Paul Erdös,et al.  On a Combinatorial Game , 1973, J. Comb. Theory A.

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

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

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

[5]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

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

[7]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[8]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

[9]  Noga Alon,et al.  Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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

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

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

[13]  Leonard J. Schulman.  Sample spaces uniform on neighborhoods , 1992, STOC '92.

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

[15]  M. Blum,et al.  Towards a computational theory of statistical tests , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

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

[18]  Nimrod Megiddo,et al.  Constructing small sample spaces satisfying given constraints , 1993, SIAM J. Discret. Math..

[19]  Noam Nisan,et al.  A parallel approximation algorithm for positive linear programming , 1993, STOC.

[20]  Y. Mansour,et al.  On construction of k-wise independent random variables , 1994, STOC '94.

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

[22]  Peter A. Beling,et al.  Using Fast Matrix Multiplication to Find Basic Solutions , 1998, Theoretical Computer Science.