High Parallel Complexity Graphs and Memory-Hard Functions

Joël Alwen, Vladimir Serbinenko. High Parallel Complexity Graphs and Memory-Hard Functions. In Rocco A. Servedio, Ronitt Rubinfeld, editors, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015. pages 595-603, ACM, 2015. [doi]

Abstract

Abstract is missing.