Analysing Survey Propagation Guided Decimation on Random Formulas

DOI10.4230/LIPIcs.ICALP.2016.65zbMath1388.68258arXiv1602.08519MaRDI QIDQ4598204

Samuel Hetterich

Publication date: 19 December 2017

Full work available at URL: https://arxiv.org/abs/1602.08519

zbMATH Keywords

graph theorymessage-passing algorithmrandom \(k\)-SATsurvey-propagation-guided decimation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Counting Solutions to Random CNF Formulas ⋮ Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem ⋮ Belief propagation on the random \(k\)-SAT model ⋮ Biased landscapes for random constraint satisfaction problems ⋮ Biased measures for random constraint satisfaction problems: larger interaction range and asymptotic expansion ⋮ Walksat Stalls Well Below Satisfiability

This page was built for publication: Analysing Survey Propagation Guided Decimation on Random Formulas