Minimizing energy below the glass thresholds

Demian Battaglia; Michal Kol\'a\v{r}; Riccardo Zecchina

REVIEW

Minimizing energy below the glass thresholds

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cond-mat/0402529 v4 pith:3OBP2M76 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

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

Share X Bluesky LinkedIn Reddit HN

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.

Minimizing energy below the glass thresholds

discussion (0)