Kakeya Sets, New Mergers, and Old Extractors
From MaRDI portal
Publication:3093623
DOI10.1137/090748731zbMath1234.68103OpenAlexW1987999558MaRDI QIDQ3093623
Publication date: 18 October 2011
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.253
Finite geometry and special incidence structures (51E99) General topics in the theory of computing (68Q01) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Local Correlation Breakers and Applications to Three-Source Extractors and Mergers, High entropy random selection protocols, Extractor Lower Bounds, Revisited, Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory, Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive derandomization, Unnamed Item, Unnamed Item, How to extract useful randomness from unreliable sources, Better short-seed quantum-proof extractors, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, Increasing the output length of zero-error dispersers