Going after the k-SAT Threshold

Amin Coja-Oghlan, Konstantinos Panagiotou

Random $k$-SAT is the single most intensely studied example of a random constraint satisfaction problem. But despite substantial progress over the past decade, the threshold for th…