Typical random 3-SAT formulae and the satisfiability threshold
Discrete Mathematics
2007-05-23 v1 Computational Complexity
Abstract
We present a new structural (or syntatic) approach for estimating the satisfiability threshold of random 3-SAT formulae. We show its efficiency in obtaining a jump from the previous upper bounds, lowering them to 4.506. The method combines well with other techniques, and also applies to other problems, such as the 3-colourability of random graphs.
Keywords
Cite
@article{arxiv.cs/0211036,
title = {Typical random 3-SAT formulae and the satisfiability threshold},
author = {Olivier Dubois and Yacine Boufkhad and Jacques Mandler},
journal= {arXiv preprint arXiv:cs/0211036},
year = {2007}
}