scientific article
From MaRDI portal
Publication:3194806
zbMath1322.68182arXiv1203.5521MaRDI QIDQ3194806
Florent Krzakala, Lenka Zdeborová, Marc Mézard
Publication date: 20 October 2015
Full work available at URL: https://arxiv.org/abs/1203.5521
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
belief propagationentropic barriersaverage hardnessplanted constraint satisfactionplanted ensemblerandom satisfiability
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
On the Complexity of Random Satisfiability Problems with Planted Solutions ⋮ Optimal testing for planted satisfiability problems ⋮ The replica symmetric phase of random constraint satisfaction problems ⋮ Self-planting: digging holes in rough landscapes ⋮ Biased landscapes for random constraint satisfaction problems ⋮ Decoding from Pooled Data: Sharp Information-Theoretic Bounds
This page was built for publication:
