An almost m-wise independent random permutation of the cube

Combinatorics Probability and Computing

Volumn 5, Issue 2, 1996, Pages 119-130

  Gowers, W T ^a,b  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030539725     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548300001917     Document Type: Article

References (10)

1. Alon, N., Goldreich, O., Hastad, J. and Peralta, R. (1992) Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms 3 289-304.
2. Diaconis, P. and Stroock, D. (1991) Geometric bounds for eigenvalues of Markov chains. Annals of Applied Probability 1 36-61.
3. Impagliazzo, R., Nisan, N. and Wigderson, A. Pseudorandomness for network algorithms. Preprint.
4. Jerrum, M. and Sinclair, A. (1988) Fast uniform generation of regular graphs. Theoretical Computer Science 73 91-100.
5. Jerrum, M. and Sinclair, A. (1989) Approximating the permanent. SIAM Journal of Computing 18 1149-1178.
6. Linial, N. and Nisan, N. (1990) Approximate inclusion-exclusion. Combinatorica 10 349-365.
7. Luby, M. and Rackoff, C. (1988) How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal of Computing 17 373-386.
8. Nisan, N. (1991) Pseudorandom bits for constant depth circuits. Combinatorica 11 63-70.
9. Nisan, N. (1992) Pseudorandom generators for space-bounded computation. Combinatorica 12 449-461.
10. Sinclair, A. (1992) Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability and Computing 1 351-370.