Note on strong refutation algorithms for random k-SAT formulas

@article{Hn2009NoteOS,
  title={Note on strong refutation algorithms for random k-SAT formulas},
  author={Hi{\^e}p H{\`a}n and Yury Person and Mathias Schacht},
  journal={Electronic Notes in Discrete Mathematics},
  year={2009},
  volume={35},
  pages={157-162}
}
We present a simple strong refutation algorithm for random k-SAT formulas. Our algorithm applies to random k-SAT formulas on n variables with ω(n)n(k+1)/2 clauses for any ω(n) → ∞. In contrast to the earlier results of Coja-Oghlan, Goerdt, and Lanka (for k = 3, 4) and Coja-Oghlan, Cooper, and Frieze (for k ≥ 5), which address the same problem for even sparser formulas our algorithm is more elementary. 

From This Paper

Topics from this paper.
4 Citations
5 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Strong refutation heuristics for random kSAT , Combin

  • C. Mathieu, A. Coja-Oghlan, A. Goerdt
  • Probab . Comput .
  • 2007

Random graphs

  • S. Janson, T. Luczak, A. Ruciński
  • Wiley-Interscience, New York, 2000, xii+333 pp.
  • 2000

Similar Papers

Loading similar papers…