Extractors for Circuit Sources
From MaRDI portal
Publication:5494966
DOI10.1109/FOCS.2011.20zbMath1292.68117MaRDI QIDQ5494966
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Unnamed Item, Unnamed Item, Extractors and Lower Bounds for Locally Samplable Sources, The complexity of estimating min-entropy, Bounded-depth circuits cannot sample good codes, Improving the Hadamard extractor, Unnamed Item