The Satisfiability Threshold of Random 3-SAT Is at Least 3.52

Author(s)
Hajiaghayi, MohammadTaghi; Sorkin, Gregory B.
Thumbnail
DownloadMIT-CSAIL-TR-2003-029.ps (6742.Kb)
Additional downloads
Other Contributors
Theory of Computation
Metadata
Show full item record
Abstract
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.
Date issued
2003-11-20
URI
http://hdl.handle.net/1721.1/30434
Other identifiers
MIT-CSAIL-TR-2003-029
MIT-LCS-TR-929
Series/Report no.
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
Collections