Affine dispersers from subspace polynomials
From MaRDI portal
Publication:5172699
DOI10.1145/1536414.1536426zbMath1304.68135OpenAlexW2034045662MaRDI QIDQ5172699
Eli Ben-Sasson, Swastik Kopparty
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1536414.1536426
Related Items (6)
From Affine to Two-Source Extractors via Approximate Duality ⋮ Improving \(3N\) circuit complexity lower bounds ⋮ Random low-degree polynomials are hard to approximate ⋮ An Introduction to Randomness Extractors ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Unnamed Item
This page was built for publication: Affine dispersers from subspace polynomials
