Delaying satisfiability for random 2SAT
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
The condensation transition in random hypergraph 2-coloring
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
Theoretical Computer Science
Catching the k-NAESAT threshold
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Going after the k-SAT threshold
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
We consider a random instance I of k-SAT with n variables and m clauses, where k=k(n) satisfies k—log2 n→∞. Let m 0=2 k nln2 and let ∈=∈(n)0 be such that ∈n→∞. We prove that $${}^{{\lim }}_{{n \to \infty }} \Pr {\left( {I\;{\text{is}}\;{\text{satisfiable}}} \right)} = \left\{ {^{{1\;m \leqslant {\left( {1 - \in } \right)}m_{0} }}_{{0\;m \geqslant {\left( {1 + \in } \right)}m_{0} }} .} \right.$$