The Satisfiability Threshold of Random 3-SAT Is at Least 3.52
Author(s)Hajiaghayi, MohammadTaghi; Sorkin, Gregory B.
Theory of Computation
MetadataShow full item record
We prove that a random 3-SAT instance with clause-to-variable densityless than 3.52 is satisfiable with high probability.The proof comes through an algorithm which selects (and sets) a variabledepending on its degree and that of its complement.
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory