Space pseudorandom generators by communication complexity lower bounds

DOI10.4230/LIPICS.APPROX-RANDOM.2014.692zbMATH Open1359.68102MaRDI QIDQ2969656FDOQ2969656

Anat Ganor, Ran Raz

Publication date: 22 March 2017

Recommendations

• Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
• Robust pseudorandom generators
• Pseudorandom generators for space-bounded computation
• Theory of Cryptography
• Pseudorandomness for network algorithms

zbMATH Keywords

communication complexitylogspacepseudorandom generator

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (3)

• Simple Optimal Hitting Sets for Small-Success RL
• Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
• Title not available (Why is that?)

This page was built for publication: Space pseudorandom generators by communication complexity lower bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969656)