Pseudorandom Bit Generators That Fool Modular Sums
From MaRDI portal
Publication:3638908
DOI10.1007/978-3-642-03685-9_46zbMath1255.68294OpenAlexW2135190153MaRDI QIDQ3638908
Shachar Lovett, Luca Trevisan, Omer Reingold, Salil P. Vadhan
Publication date: 28 October 2009
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03685-9_46
Related Items
Pseudorandomness via the Discrete Fourier Transform, Entropy of Weight Distributions of Small-Bias Spaces and Pseudobinomiality, Pseudorandom generators for \(\mathrm{CC}^0[p\) and the Fourier spectrum of low-degree polynomials over finite fields], Pseudorandom generators for combinatorial checkerboards, Small-bias is not enough to hit read-once CNF, Improved bounds for quantified derandomization of constant-depth circuits and polynomials, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition