TCS+ Talk

Wednesday February 18, 2015 10:00 AM

Proof of the satisfiability conjecture for large k

Speaker: Allan Sly, UC Berkeley
Location: Annenberg 308

Available remotely at Google Hangouts:

https://sites.google.com/site/plustcs/ 

Abstract:

We establish the random k-SAT threshold conjecture for all k
exceeding an absolute constant k_0. That is, there is a single critical
value \alpha_c(k) such that a random k-SAT formula at clause-to-variable
ratio \alpha is with high probability satisfiable for
\alpha<\alpha_c(k), and unsatisfiable for \alpha>\alpha_c(k). The
threshold \alpha_c(k) matches the explicit prediction derived by
statistical physicists on the basis of the one-step replica symmetry
breaking (1RSB) heuristic.

Joint work with Jian Ding and Nike Sun. 
Series TCS+ Talks

Contact: Thomas Vidick vidick@cms.caltech.edu