The Satisfiability Threshold of Random 3-SAT Is at Least 3.52
| dc.date.accessioned | 2005-12-22T01:14:48Z | |
| dc.date.accessioned | 2018-11-24T10:23:58Z | |
| dc.date.available | 2005-12-22T01:14:48Z | |
| dc.date.available | 2018-11-24T10:23:58Z | |
| dc.date.issued | 2003-11-20 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/30434 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/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.language.iso | en_US | |
| dc.title | The Satisfiability Threshold of Random 3-SAT Is at Least 3.52 |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| MIT-CSAIL-TR-2003-029.pdf | 339.4Kb | application/pdf | View/ |
| MIT-CSAIL-TR-2003-029.ps | 6.904Mb | application/postscript | View/ |