Minimizing energy below the glass thresholds

arxiv: cond-mat/0402529 · v4 · pith:3OBP2M76new · submitted 2004-02-20 · ❄️ cond-mat.dis-nn

Minimizing energy below the glass thresholds

Demian Battaglia , Michal Kol\'a\v{r} , Riccardo Zecchina This is my paper

classification ❄️ cond-mat.dis-nn

keywords energybelowproblemversionalgorithmanalyticbacktrackbound

0 comments p. Extension

pith:3OBP2M76 Add to your LaTeX paper

What is a Pith Number?

\usepackage{pith}
\pithnumber{3OBP2M76}

Prints a linked pith:3OBP2M76 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

Focusing on the optimization version of the random K-satisfiability problem, the MAX-K-SAT problem, we study the performance of the finite energy version of the Survey Propagation (SP) algorithm. We show that a simple (linear time) backtrack decimation strategy is sufficient to reach configurations well below the lower bound for the dynamic threshold energy and very close to the analytic prediction for the optimal ground states. A comparative numerical study on one of the most efficient local search procedures is also given.

This paper has not been read by Pith yet.

Minimizing energy below the glass thresholds

discussion (0)