Tricritical points in random combinatorics: the ?-SAT case
Abstract
The 0305-4470/31/46/011/img6-satisfiability (SAT) problem interpolates between different classes of complexity theory and is thought 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 0305-4470/31/46/011/img6-SAT problem is analytically computed using the replica approach and found to lie in the range 0305-4470/31/46/011/img8. These bounds on 0305-4470/31/46/011/img9 are in agreement with previous numerical simulations and rigorous results.
- Publication:
-
Journal of Physics A Mathematical General
- Pub Date:
- November 1998
- DOI:
- 10.1088/0305-4470/31/46/011
- arXiv:
- arXiv:cond-mat/9810008
- Bibcode:
- 1998JPhA...31.9209M
- Keywords:
-
- Condensed Matter - Disordered Systems and Neural Networks
- E-Print:
- 7 pages, 1 figure, RevTeX, to appear in J.Phys.A