Tricritical points in random combinatorics: the -SAT case

DOI10.1088/0305-4470/31/46/011zbMath0942.68052arXivcond-mat/9810008OpenAlexW3123481344WikidataQ61444480 ScholiaQ61444480MaRDI QIDQ4950549

Riccardo Zecchina, Remi Monasson

Publication date: 6 April 2000

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/9810008

zbMATH Keywords

satisfiability problemrandom \(K\)-satisfiability

Mathematics Subject Classification ID

Related Items (8)

Unnamed Item ⋮ Computational complexity of some restricted instances of 3-SAT ⋮ Blume-Emery-Griffiths model on random graphs ⋮ (2+\(f\)(\(n\)))-SAT and its properties. ⋮ Statistical mechanics methods and phase transitions in optimization problems ⋮ Rigorous results for random (\(2+p)\)-SAT ⋮ Random 2-SAT: Results and problems ⋮ Techniques of replica symmetry breaking and the storage problem of the McCulloch-Pitts neuron

This page was built for publication: Tricritical points in random combinatorics: the -SAT case