The unified theory of pseudorandomness
From MaRDI portal
Publication:3096715
expander graphserror-correcting codespseudorandom generatorslist decodingrandomness extractorshardness amplificationsamplers
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) General topics of discrete mathematics in relation to computer science (68R01) Theory of error-correcting codes and error-detecting codes (94B99) General topics in the theory of computing (68Q01)
Recommendations
Cited in
(12)- Pseudorandom generators for combinatorial checkerboards
- List Decoding and Pseudorandom Constructions
- Pseudo-randomness: objects and generation
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- A unified approach to the analysis of compound pseudorandom numbers
- The complexity of the matroid-greedoid partition problem
- Pseudorandomness
- Pseudorandomness in computer science and in additive combinatorics
- Pseudorandom generators without the XOR lemma
- scientific article; zbMATH DE number 1833398 (Why is no real title available?)
- The complexity of explicit constructions
- A primer on pseudorandom generators
This page was built for publication: The unified theory of pseudorandomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096715)