Show simple item record

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

dc.date.accessioned2005-12-22T01:14:48Z
dc.date.accessioned2018-11-24T10:23:58Z
dc.date.available2005-12-22T01:14:48Z
dc.date.available2018-11-24T10:23:58Z
dc.date.issued2003-11-20
dc.identifier.urihttp://hdl.handle.net/1721.1/30434
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/30434
dc.description.abstractWe 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.extent8 p.
dc.format.extent6904092 bytes
dc.format.extent339435 bytes
dc.language.isoen_US
dc.titleThe Satisfiability Threshold of Random 3-SAT Is at Least 3.52


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2003-029.pdf339.4Kbapplication/pdfView/Open
MIT-CSAIL-TR-2003-029.ps6.904Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record