The Satisfiability Threshold of Random 3-SAT Is at Least 3.52
Combinatorics
2007-05-23 v2 Discrete Mathematics
Probability
Abstract
We prove that a random 3-SAT instance with clause-to-variable density less than 3.52 is satisfiable with high probability. The proof comes through an algorithm which selects (and sets) a variable depending on its degree and that of its complement.
Keywords
Cite
@article{arxiv.math/0310193,
title = {The Satisfiability Threshold of Random 3-SAT Is at Least 3.52},
author = {MohammadTaghi Hajiaghayi and Gregory B. Sorkin},
journal= {arXiv preprint arXiv:math/0310193},
year = {2007}
}