On the Complexity of Random Satisfiability Problems with Planted Solutions.

Vitaly Feldman, Will Perkins, Santosh S. Vempala

Browse the full STOC paper archive.