论文信息 - Efficient approximation of product distributions

Efficient approximation of product distributions

We describe efficient constructions of small probability spaces that approximate the joint distribution of general random variables. Previous work on efficient constructions concentrate on approximations of the joint distribution for the special case of identical, uniformly distributed random variables. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 13: 1–16, 1998

Oded Goldreich | M. Luby | N. Nisan | G. Even | B. Velickovic

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

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

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

[4] Michael Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..

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

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

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

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

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

[10] David R. Karger,et al. (De)randomized Construction of Small Sample Spaces in NC , 1997, J. Comput. Syst. Sci..