Space Pseudorandom Generators by Communication Complexity Lower Bounds

Anat Ganor, Ran Raz. Space Pseudorandom Generators by Communication Complexity Lower Bounds. In Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, Cristopher Moore, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain. Volume 28 of LIPIcs, pages 692-703, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. [doi]

Abstract

Abstract is missing.