Erratum for
From MaRDI portal
Publication:2875206
DOI10.1145/1806689.1806798zbMath1302.68131OpenAlexW2162586049MaRDI QIDQ2875206
Shafi Goldwasser, Dana Moshkovitz, Oded Goldreich, Adi Akavia
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1806689.1806798
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20)
Related Items
Unnamed Item, On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets, Fine-grained cryptography revisited
