Pages that link to "Item:Q626620"
From MaRDI portal
The following pages link to The sum of \(D\) small-bias generators fools polynomials of degree \(D\) (Q626620):
Displaying 18 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)
- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting (Q1656545) (← links)
- On hitting-set generators for polynomials that vanish rarely (Q2099672) (← links)
- Improved bounds on the an-complexity of \(O(1)\)-linear functions (Q2159467) (← links)
- Improved bounds for quantified derandomization of constant-depth circuits and polynomials (Q2311548) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- (Q5009555) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- (Q5077146) (← links)
- (Q5121889) (← links)
- Amplification and Derandomization without Slowdown (Q5129234) (← links)
- (Q5140841) (← links)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
- (Q5875501) (← links)
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892608) (← links)
- On the modulo degree complexity of Boolean functions (Q5918108) (← links)
