A backtracking survey propagation algorithm for K-satisfiability
无序系统与神经网络
2007-05-23 v1 统计力学
摘要
In this paper we present a backtracking version of the survey propagation algorithm. We show that the introduction of the simplest form of backtracking greatly improves the ability of the original survey propagation algorithm in solving difficult random problems near the sat-unsat transition.
引用
@article{arxiv.cond-mat/0308510,
title = {A backtracking survey propagation algorithm for K-satisfiability},
author = {Giorgio Parisi},
journal= {arXiv preprint arXiv:cond-mat/0308510},
year = {2007}
}
备注
9 pages, two figures