no code implementations • 5 Jul 2021 • Sumegha Garg, Pravesh K. Kothari, Pengda Liu, Ran Raz
We show that any learning algorithm for the learning problem corresponding to $M$, with error, requires either a memory of size at least $\Omega\left(\frac{k \cdot \ell}{\varepsilon} \right)$, or at least $2^{\Omega(r)}$ samples.
no code implementations • 18 Nov 2020 • Kunal Mittal, Ran Raz
We then describe a class of multiplayer games, such that, a sufficiently strong parallel repetition theorem for that class of games implies an explicit block-rigid function.
Computational Complexity
no code implementations • 8 Aug 2017 • Sumegha Garg, Ran Raz, Avishay Tal
We show that any learning algorithm for the learning problem corresponding to $M$ requires either a memory of size at least $\Omega\left(k \cdot \ell \right)$, or at least $2^{\Omega(r)}$ samples.
no code implementations • 16 Feb 2016 • Ran Raz
Previous works on bounded-storage cryptography assumed that the memory size used by the attacker is at most linear in the time needed for encryption/decription.
