The sum of \(D\) small-bias generators fools polynomials of degree \(D\)
From MaRDI portal
Publication:626620
DOI10.1007/s00037-009-0273-5zbMath1217.68157OpenAlexW2125212199MaRDI QIDQ626620
Publication date: 18 February 2011
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-009-0273-5
Related Items (19)
Quantified Derandomization: How to Find Water in the Ocean ⋮ Cryptographic hardness of random local functions. Survey ⋮ Improved bounds on the an-complexity of \(O(1)\)-linear functions ⋮ A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting ⋮ Pseudorandom generators for \(\mathrm{CC}^0[p\) and the Fourier spectrum of low-degree polynomials over finite fields] ⋮ Pseudorandom generators for combinatorial checkerboards ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Counting Solutions to Polynomial Systems via Reductions ⋮ Amplification and Derandomization without Slowdown ⋮ Bounded Independence Plus Noise Fools Products ⋮ Unnamed Item ⋮ On the modulo degree complexity of Boolean functions ⋮ A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem ⋮ Unnamed Item ⋮ Improved bounds for quantified derandomization of constant-depth circuits and polynomials ⋮ Unnamed Item ⋮ On hitting-set generators for polynomials that vanish rarely
This page was built for publication: The sum of \(D\) small-bias generators fools polynomials of degree \(D\)
