Dispersers for Affine Sources with Sub-polynomial Entropy
From MaRDI portal
Publication:5494969
DOI10.1109/FOCS.2011.37zbMath1292.68115MaRDI QIDQ5494969
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (6)
On various nonlinearity measures for Boolean functions ⋮ From Affine to Two-Source Extractors via Approximate Duality ⋮ Constructive Relationships Between Algebraic Thickness and Normality ⋮ Improving \(3N\) circuit complexity lower bounds ⋮ Gate elimination: circuit size lower bounds and \#SAT upper bounds ⋮ An Introduction to Randomness Extractors
This page was built for publication: Dispersers for Affine Sources with Sub-polynomial Entropy
