A Better Algorithm for Random k-SAT

Authors:
Amin Coja-Oghlan
Affiliations:
School of Informatics, University of Edinburgh, Edinburgh, UK EH8 9AB
Venue:
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Year:
2009

Citing 9
Cited 0

Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem

Information Sciences: an International Journal
Analysis of two simple heuristics on a random instance of k-SAT

Journal of Algorithms
Exponential bounds for DPLL below the satisfiability threshold

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Survey propagation: An algorithm for satisfiability

Random Structures & Algorithms
The probabilistic analysis of a greedy satisfiability algorithm

Random Structures & Algorithms
Random $k$-SAT: Two Moments Suffice to Cross a Sharp Threshold

SIAM Journal on Computing
Mick gets some (the odds are on his side) (satisfiability)

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Algorithmic Barriers from Phase Transitions

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
On smoothed k-CNF formulas and the Walksat algorithm

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

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 $m/n , 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].