Bounds for Random Constraint Satisfaction Problems via Spatial Coupling

DOI10.1137/1.9781611974331.ch35zbMath1410.68137OpenAlexW4229724597MaRDI QIDQ4575612

No author found.

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1765f446ada8e2733ac109a546f7ce290c774322

Mathematics Subject Classification ID

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 (3)

Information-theoretic thresholds from the cavity method ⋮ Charting the replica symmetric phase ⋮ Spin systems on Bethe lattices

This page was built for publication: Bounds for Random Constraint Satisfaction Problems via Spatial Coupling