Typical random 3-SAT formulae and the satisfiability threshold

TL;DR

This paper introduces a new structural approach to estimate the satisfiability threshold of random 3-SAT formulas, successfully lowering the upper bounds and demonstrating versatility across related problems.

Contribution

A novel structural method for estimating the satisfiability threshold that improves upper bounds and applies to other combinatorial problems.

Findings

Lowered the upper bound of the satisfiability threshold to 4.506

Demonstrated the method's effectiveness in other problems like 3-colorability

Enhanced understanding of the structural properties of random 3-SAT formulas

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.