Dispersers for Affine Sources with Sub-polynomial Entropy
From MaRDI portal
Publication:5494969
DOI10.1109/FOCS.2011.37zbMATH Open1292.68115MaRDI QIDQ5494969FDOQ5494969
Authors: Ronen Shaltiel 
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (6)
- On various nonlinearity measures for Boolean functions
- From affine to two-source extractors via approximate duality
- Improving \(3N\) circuit complexity lower bounds
- Constructive relationships between algebraic thickness and normality
- An introduction to randomness extractors
- Gate elimination: circuit size lower bounds and \#SAT upper bounds
This page was built for publication: Dispersers for Affine Sources with Sub-polynomial Entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494969)
