Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\)
The electronic journal of combinatorics, Tome 15 (2008)
We consider a random instance $I_m=I_{m,n,k}$ of $k$-SAT with $n$ variables and $m$ clauses, where $k=k(n)$ satisfies $k-\log_2 n\to\infty$. Let $m=2^k(n\ln 2+c)$ for an absolute constant $c$. We prove that $$\lim_{n\to\infty}\Pr(I_m\hbox{ is satisfiable})=e^{-e^{-c}}.$$
@article{10_37236_877,
author = {Amin Coja-Oghlan and Alan Frieze},
title = {Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\)},
journal = {The electronic journal of combinatorics},
year = {2008},
volume = {15},
doi = {10.37236/877},
zbl = {1163.68337},
url = {http://geodesic.mathdoc.fr/articles/10.37236/877/}
}
TY - JOUR AU - Amin Coja-Oghlan AU - Alan Frieze TI - Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\) JO - The electronic journal of combinatorics PY - 2008 VL - 15 UR - http://geodesic.mathdoc.fr/articles/10.37236/877/ DO - 10.37236/877 ID - 10_37236_877 ER -
Amin Coja-Oghlan; Alan Frieze. Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\). The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/877
Cité par Sources :