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

dc.contributor.author	Hajiaghayi, MohammadTaghi
dc.contributor.author	Sorkin, Gregory B.
dc.contributor.other	Theory of Computation
dc.date.accessioned	2005-12-22T01:14:48Z
dc.date.available	2005-12-22T01:14:48Z
dc.date.issued	2003-11-20
dc.identifier.other	MIT-CSAIL-TR-2003-029
dc.identifier.other	MIT-LCS-TR-929
dc.identifier.uri	http://hdl.handle.net/1721.1/30434
dc.description.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.
dc.format.extent	8 p.
dc.format.extent	6904092 bytes
dc.format.extent	339435 bytes
dc.format.mimetype	application/postscript
dc.format.mimetype	application/pdf
dc.language.iso	en_US
dc.relation.ispartofseries	Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
dc.title	The Satisfiability Threshold of Random 3-SAT Is at Least 3.52