Skip to Main content Skip to Navigation
Journal articles

Generating functions and the satisfiability threshold

Vincent Puyhaubert 1
1 ALGORITHMS - Algorithms
Inria Paris-Rocquencourt
Abstract : The 3-SAT problem consists in determining if a boolean formula with 3 literals per clause is satisfiable. When the ratio between the number of clauses and the number of variables increases, a threshold phenomenon is observed: the probability of satisfiability appears to decrease sharply from 1 to 0 in the neighbourghood of a threshold value, conjectured to be close to 4.25. Although the threshold has been proved to exist for the 2-SAT formulæ and for closely related problems like 3-XORSAT, there is still no proof for the 3-sat problem. Recent works have provided so far upper and lower bounds for the threshold's potential location. We present here a unified approach to upper bounds that is based on urn models, generating functions, and saddle-point bounds. In this way, we re-derive some of the most significant upper bounds known in a simple and uniform manner.
Document type :
Journal articles
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-00959018
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 5:06:29 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Friday, June 13, 2014 - 12:17:54 PM

File

dm060216.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00959018, version 1

Collections

Citation

Vincent Puyhaubert. Generating functions and the satisfiability threshold. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2004, 6 (2), pp.425-436. ⟨hal-00959018⟩

Share

Metrics

Record views

229

Files downloads

734