Foundations and Trends® in Theoretical Computer Science
PAIRWISE INDEPENDENCE AND DERANDOMIZATION
by Michael Luby (Digital Fountain, USA) & Avi Wigderson (Institute of Advanced Studies, USA)
Pairwise Independence and Derandomization gives several applications of the following paradigm, which has proven extremely powerful in algorithm design and computational complexity. First, design a probabilistic algorithm for a given problem. Then, show that the correctness analysis of the algorithm remains valid even when the random strings used by the algorithm do not come from the uniform distribution, but rather from a small sample space, appropriately chosen. In some cases this can be proven directly (giving “unconditional derandomization”), and in others it uses computational assumptions, like the existence of 1-way functions (giving “conditional derandomization”).
Pairwise Independence and Derandomization is self contained, and is a prime manifestation of the “derandomization” paradigm. It is intended for scholars and graduate students in the field of theoretical computer science interested in randomness, derandomization and their interplay with computational complexity.
Published by Now Publishers and marketed by World Scientific
Contents:
- Pairwise Independence
- Limited Independence Probability Spaces
-
Pairwise Independence and Complexity Classes
- Recycling Randomness
- Pseudo-Random Generators
- Deterministic Counting
- Acknowledgements
- References
Readership: Postgraduates and professionals.
|
