Vitaly Feldman, Will Perkins, Santosh Vempala. On the Complexity of Random Satisfiability Problems with Planted Solutions. 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 77-86, ACM, 2015. [doi]
Abstract is missing.