Pages that link to "Item:Q3638908"
From MaRDI portal
The following pages link to Pseudorandom Bit Generators That Fool Modular Sums (Q3638908):
Displayed 7 items.
- Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields (Q395606) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Small-bias is not enough to hit read-once CNF (Q519906) (← links)
- Improved bounds for quantified derandomization of constant-depth circuits and polynomials (Q2311548) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Entropy of Weight Distributions of Small-Bias Spaces and Pseudobinomiality (Q3196409) (← links)
- Pseudorandomness via the Discrete Fourier Transform (Q4562280) (← links)