A Better Algorithm for Random k-SAT

Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high probability for constraint densities m/n < (1 − εk)2k ln(k)/k, where εk → 0. Previously no efficient algorithm was known

• Type: Conference
• Year: 2009
• Where: ICALP
• Authors: Amin Coja-Oghlan
• Keywords: ICALP 2009, Polynomial Time Algorithm, Random K-SAT Formula, Satisfying Assignment, Theoretical Computer Science