On the satisfiability threshold of formulas with three literals per clause

Abstract

In this paper we present a new upper bound for randomly chosen 3-CNF formulas. In particular we show that any random formula over n variables, with a clauses-to-variables ratio of at least 4.4898 is, as n grows large, asymptotically almost surely unsatisfiable. The previous best such bound, due to Dubois in 1999, was 4.506. The first such bound… (More)
DOI: 10.1016/j.tcs.2009.02.020

Topics

Cite this paper

@article{Daz2009OnTS, title={On the satisfiability threshold of formulas with three literals per clause}, author={Josep D{\'i}az and Lefteris M. Kirousis and Dieter Mitsche and Xavier P{\'e}rez-Gim{\'e}nez}, journal={Theor. Comput. Sci.}, year={2009}, volume={410}, pages={2920-2934} }