Answers are grounded in this paper and cite their sources.
We study the low temperature properties of p-spin glass models with finite connectivity and of some optimization problems. Using a one-step functional replica symmetry breaking ansatz we can solve exactly the saddle-point equations for graphs with uniform connectivity. The resulting ground state energy is in perfect agreement with numerical simulations. For fluctuating connectivity graphs, the same ansatz can be used in a variational way: For p-spin models (known as p-XOR-SAT in computer science) it provides the exact configurational entropy together with the dynamical and static critical connectivities (for p0ex0ex=0ex0ex3, γd0ex0ex=0ex0ex0.818, and γₛ0ex0ex=0ex0ex0.918), whereas for hard optimization problems like 3-SAT or Bicoloring it provides new upper bounds for their critical thresholds ( γcᵛᵃʳ0ex0ex=0ex0ex4.396 and γcᵛᵃʳ0ex0ex=0ex0ex2.149).
No takes yet. Share an insight, caveat, or question.
Franz et al. (2001) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: