arXiv · cond-mat/0412652
Source coding by efficient selection of ground states clusters
Abstract
In this letter, we show how the Survey Propagation algorithm can be generalized to include external forcing messages, and used to address selectively an exponential number of glassy ground states. These capabilities can be used to explore efficiently the space of solutions of random NP-complete constraint satisfaction problems, providing a direct experimental evidence of replica symmetry breaking in large-size instances. Finally, a new lossy data compression protocol is introduced, exploiting as a computational resource the clustered nature of the space of addressable states.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Demian Battaglia, Alfredo Braunstein, Joël Chavas, Riccardo Zecchina. 2004-12-23. Source coding by efficient selection of ground states clusters. https://doi.org/10.1103/physreve.72.015103
Cite the original work for its findings. Save a collection to share your selection of sources.