Pseudorandom generators from polarizing random walks
From MaRDI portal
Publication:5204828
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Randomized algorithms (68W20) Sums of independent random variables; random walks (60G50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean functions (06E30)
Recommendations
Cited in
(8)- A random-walk pseudorandom byte generator
- Pseudorandom generators for low sensitivity functions
- Paradigms for Unconditional Pseudorandom Generators
- scientific article; zbMATH DE number 7528580 (Why is no real title available?)
- scientific article; zbMATH DE number 7250141 (Why is no real title available?)
- Near-optimal derandomization of medium-width branching programs
- Quantum cryptography in Algorithmica
- Pseudorandomness via the discrete Fourier transform
This page was built for publication: Pseudorandom generators from polarizing random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204828)