The following pages link to (Q3002801):
Displaying 14 items.
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- 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)
- On hitting-set generators for polynomials that vanish rarely (Q2099672) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- (Q5009555) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- (Q5077146) (← links)
- (Q5140841) (← links)
- (Q5500596) (← links)
- (Q5875501) (← links)
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892608) (← links)
- (Q6084350) (← links)
