A Better Algorithm for Random k-SAT
Coja-Oghlan, A (2010) A Better Algorithm for Random k-SAT. Siam Journal on Computing, 39 (7). pp. 2823-2864. ISSN 0097-5397
![[img]](http://eprints.dcs.warwick.ac.uk/style/images/fileicons/application_pdf.png)
| PDF - Published Version Download (489Kb) | Preview |
Official URL: http://dx.doi.org/10.1137/09076516X
Abstract
Let F be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of F with high probability for constraint densities m/n<(1-eps_k)2^k(k)/k, where eps_k->0. Previously no efficient algorithm was known to find solutions with non-vanishing probability beyond m/n=1.817.2^k/k [Frieze and Suen, J. of Algorithms 1996].
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | focs random structures, efficient algorithms, phase transitions, k-SAT |
| Subjects: | Q Science > QA Mathematics > QA76.73 Computer algorithms. Data structures. |
| Divisions: | Faculty of Science > Computer Science |
| Depositing User: | Mr Ebrahim Ardeshir |
| Date Deposited: | 26 Nov 2010 09:15 |
| Last Modified: | 20 Oct 2011 12:58 |
| URI: | http://eprints.dcs.warwick.ac.uk/id/eprint/390 |
Actions (login required)
| View Item |
