Buch, Englisch, Band 4, 88 Seiten, Format (B × H): 156 mm x 234 mm, Gewicht: 122 g
Reihe: Foundations and Trends® in Theoretical Computer Science
Buch, Englisch, Band 4, 88 Seiten, Format (B × H): 156 mm x 234 mm, Gewicht: 122 g
Reihe: Foundations and Trends® in Theoretical Computer Science
ISBN: 978-1-933019-22-2
Verlag: NEW PUBL INC
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.
Autoren/Hrsg.
Weitere Infos & Material
1. Pairwise Independence; 2. Limited Independence Probability Spaces; 3. Pairwise Independence and Complexity Classes; 4. Recycling randomness; 5. Pseudo-random generators; 6. Deterministic Counting; Acknowledgements; References
