Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
3 tokens/sec
DeepSeek R1 via Azure Pro
51 tokens/sec
2000 character limit reached

Revisiting the cavity-method threshold for random 3-SAT (1712.04888v3)

Published 13 Dec 2017 in cond-mat.stat-mech and cond-mat.dis-nn

Abstract: A detailed Monte Carlo-study of the satisfiability threshold for random 3-SAT has been undertaken. In combination with a monotonicity assumption we find that the threshold for random 3-SAT satisfies $\alpha_3 \leq 4.262$. If the assumption is correct, this means that the actual threshold value for $k=3$ is lower than that given by the cavity method. In contrast the latter has recently been shown to give the correct value for large $k$. Our result thus indicate that there are distinct behaviors for $k$ above and below some critical $k_c$, and the cavity method may provide a correct mean-field picture for the range above $k_c$.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.