Tricritical Points in Random Combinatorics: the (2+p)-SAT case
Remi Monasson, Riccardo Zecchina
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 p0 0.416. These bounds on p0 are in agreement with previous numerical simulations and rigorous results.
Create a lesson
Related papers
Low-temperature magnetism and spin dynamics in the disordered triangular-lattice Yb3+ compound LiCaYb5(BO3)6
Monika Jawale, Saikat Nandi, Prashanta K. Mukharjee et al.
Neural Renormalization Group Flow for Percolation
Anaclara Alvez, Luca Camagna, Sergio Chibbaro et al.
Dynamical phase selection controls compute scaling in looped transformers
Gunn Kim
Semi-localized ground state in a 1D system with long-range hopping
Murod S. Bahovadinov, Faridun N. Jalolov, Vladimir E. Kravtsov et al.
Defect states in three-dimensional diamond photonic band gap crystals
Julia Rocha, Bart A. van Tiggelen, Ad Lagendijk et al.
Disorder-induced conducting edges on Kagomé lattice
A. Chmeruk, D. Jones, L. Chioncel