arXiv · cond-mat/9810008
Tricritical Points in Random Combinatorics: the (2+p)-SAT case
Abstract
The (2+p)-Satisfiability (SAT) problem interpolates between different classes of complexity theory and is believed to be of basic interest in understanding the onset of typical case complexity in random combinatorics. In this paper, a tricritical point in the phase diagram of the random $2+p$-SAT problem is analytically computed using the replica approach and found to lie in the range $2/5 \le p_0 \le 0.416$. These bounds on $p_0$ are in agreement with previous numerical simulations and rigorous results.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Remi Monasson, Riccardo Zecchina. 1998-10-01. Tricritical Points in Random Combinatorics: the (2+p)-SAT case. https://doi.org/10.1088/0305-4470%2F31%2F46%2F011
Cite the original work for its findings. Save a collection to share your selection of sources.