The following pages link to Pseudorandom Bits for Polynomials (Q3068640):
Displayed 22 items.
- A dichotomy for local small-bias generators (Q315550) (← links)
- 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)
- The inverse conjecture for the Gowers norm over finite fields in low characteristic (Q434231) (← links)
- The communication complexity of addition (Q519955) (← links)
- On hitting-set generators for polynomials that vanish rarely (Q2099672) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← 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)
- Small Sample Spaces Cannot Fool Low Degree Polynomials (Q3541801) (← 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)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
- Reed-Muller Codes (Q5870775) (← links)
- (Q5875501) (← links)
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892608) (← links)
- Paradigms for Unconditional Pseudorandom Generators (Q6149335) (← links)
- Partition and analytic rank are equivalent over large fields (Q6183950) (← links)