论文信息 - Almost k-wise independence versus k-wise independence - 字舞流文

Almost k-wise independence versus k-wise independence

Noga Alon | Oded Goldreich | Yishay Mansour | Y. Mansour | Oded Goldreich | N. Alon

[1] Oded Goldreich,et al. Simple Constructions of Almost k -wise Independent Random Variables , 2002 .

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

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

[4] U. Vazirani. Randomness, adversaries and computation (random polynomial time) , 1986 .

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

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

[7] Oded Goldreich,et al. The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) , 1985, FOCS.

[8] C. R. Rao,et al. Factorial Experiments Derivable from Combinatorial Arrangements of Arrays , 1947 .