Published in

American Physical Society, Physical review E: Statistical, nonlinear, and soft matter physics, 3(70), 2004

DOI: 10.1103/physreve.70.036107

Links

Tools

Export citation

Search in Google Scholar

Minimizing energy below the glass thresholds

Journal article published in 2004 by Demian A. Battaglia, Michal Kolár ORCID, Riccardo Zecchina
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Green circle
Published version: archiving allowed
Upload
Policy details
Data provided by SHERPA/RoMEO

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.