Abstract
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 , where ε k →0. Previously no efficient algorithm was known to find solutions with non-vanishing probability beyond m/n=1.817•2 k /k [Frieze and Suen, Journal of Algorithms 1996]. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Coja-Oghlan, A. (2009). A better algorithm for random κ-SAT. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5555 LNCS, pp. 292–303). https://doi.org/10.1007/978-3-642-02927-1_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
