Pseudorandomness
Foundations and Trends® in Theoretical Computer Science · 20.12.2012 · 7 (1-3) · 1-336
DOI: 10.1561/0400000010 ↗Kurz gefasst
Fachartikel in der Zeitschrift Foundations and Trends® in Theoretical Computer Science, online erschienen am 20.12.2012. Verfasst von Salil P. Vadhan. Die Arbeit wurde bisher 221-mal zitiert (Crossref) und nennt 428 Literaturangaben.
Abstract (Originalsprache)
This is a survey of pseudorandomness, the theory of efficiently generating objects that "look random" despite being constructed using little or no randomness. This theory has significance for a number of areas in computer science and mathematics, including computational complexity, algorithms, cryptography, combinatorics, communications, and additive number theory. Our treatment places particular emphasis on the intimate connections that have been discovered between a variety of fundamental "pseudorandom objects" that at first seem very different in nature: expander graphs, randomness extractors, list-decodable error-correcting codes, samplers, and pseudorandom generators. The structure of the presentation is meant to be suitable for teaching in a graduate-level course, with exercises accompanying each section.
Zitieren
APA
Vadhan, S. P. (2012). Pseudorandomness. Foundations and Trends® in Theoretical Computer Science, 7(1-3), 1-336. https://doi.org/10.1561/0400000010
Vancouver
Vadhan SP. Pseudorandomness. Foundations and Trends® in Theoretical Computer Science. 2012;7(1-3):1-336. doi:10.1561/0400000010
BibTeX
@article{Vadhan2012,
author = {Vadhan, Salil P.},
title = {Pseudorandomness},
journal = {Foundations and Trends® in Theoretical Computer Science},
year = {2012},
volume = {7},
number = {1-3},
pages = {1--336},
doi = {10.1561/0400000010}
}
EUVIMED