Simple permutations mix well
From MaRDI portal
Recommendations
- Simple permutations mix well
- Simple permutations mix even better
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions
Cited in
(9)- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Simple permutations mix well
- Random permutations using switching networks
- Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions
- Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
- Simple permutations mix even better
- An Almost m-wise Independent Random Permutation of the Cube
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- When simple permutations mix poorly. Limited independence does not imply pseudorandomness
This page was built for publication: Simple permutations mix well
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466512)