Vitaly Feldman, Will Perkins, Santosh Vempala
On the Complexity of Random Satisfiability Problems with Planted Solutions
STOC, 2015.
@inproceedings{STOC-2015-FeldmanPV, author = "Vitaly Feldman and Will Perkins and Santosh Vempala", booktitle = "{Proceedings of the 47th Annual ACM Symposium on Theory of Computing}", doi = "10.1145/2746539.2746577", isbn = "978-1-4503-3536-2", pages = "77--86", publisher = "{ACM}", title = "{On the Complexity of Random Satisfiability Problems with Planted Solutions}", year = 2015, }