Quiet planting in the locked constraints satisfaction problems

Journal Article · Thu Jan 01 00:00:00 EST 2009 · SIAM Journal on Discrede Mathematics

OSTI ID:956457

Zdeborova, Lenka ^[1]; Krzakala, Florent ^[1]

---

1. Los Alamos National Laboratory

We study the planted ensemble of locked constraint satisfaction problems. We describe the connection between the random and planted ensembles. The use of the cavity method is combined with arguments from reconstruction on trees and first and second moment considerations; in particular the connection with the reconstruction on trees appears to be crucial. Our main result is the location of the hard region in the planted ensemble, thus providing hard satisfiable benchmarks. In a part of that hard region instances have with high probability a single satisfying assignment.

• Research Organization: Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
• Sponsoring Organization: USDOE
• DOE Contract Number: AC52-06NA25396
• OSTI ID: 956457
• Report Number(s): LA-UR-09-01115; LA-UR-09-1115; TRN: US201013%%172
• Journal Information: SIAM Journal on Discrede Mathematics, Journal Name: SIAM Journal on Discrede Mathematics
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING
BENCHMARKS
PROBABILITY
TREES