A note on random \(k\)-SAT for moderately growing \(k\) (Q426783): Difference between revisions

Summary: Consider a random instance \(I\) of \(k\)-SAT with \(n\) variables and \(m\) clauses. Suppose that \(\theta, c>0\) are any fixed real numbers. Let \(k=k(n)\geq \big(\frac{1}{2}+\theta\big)\log_{2}n\). We prove that \[ \lim_{n\rightarrow\infty}\operatorname{Pr}(I\;\text{is satifiable})=\begin{cases} 1\quad m\leq\big(1-\frac{c}{\sqrt{n}}\big)2^{k}n\ln 2 \\0\quad m\geq\big(1+\frac{c}{\sqrt{n}}\big)2^{k}n\ln 2.\end{cases} \]