A note on random k-SAT for moderately growing k
From MaRDI portal
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} \]
Recommendations
Cited in
(6)- Random k-sat: the limiting probability for satisfiability for moderately growing k
- On the constraint length of random \(k\)-CSP
- Random k-SAT: A tight threshold for moderately growing k
- Biased random k‐SAT
- Sharp phase transitions for the overlap gap property
- Sharp thresholds for the overlap gap property: Ising p-spin Glass and random k-SAT
This page was built for publication: A note on random \(k\)-SAT for moderately growing \(k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426783)
