Dispersers for Affine Sources with Sub-polynomial Entropy

DOI10.1109/FOCS.2011.37MaRDI QIDQ5494969zbMATH OpenFDO

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)

Mathematics Subject Classification ID

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
• Constructive relationships between algebraic thickness and normality
• Improving \(3N\) circuit complexity lower bounds
• 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)