Simplifying Random Satisfiability Problem by Removing Frustrating Interactions
统计力学
2009-11-11 v1 计算复杂性
摘要
How can we remove some interactions in a constraint satisfaction problem (CSP) such that it still remains satisfiable? In this paper we study a modified survey propagation algorithm that enables us to address this question for a prototypical CSP, i.e. random K-satisfiability problem. The average number of removed interactions is controlled by a tuning parameter in the algorithm. If the original problem is satisfiable then we are able to construct satisfiable subproblems ranging from the original one to a minimal one with minimum possible number of interactions. The minimal satisfiable subproblems will provide directly the solutions of the original problem.
引用
@article{arxiv.cond-mat/0606128,
title = {Simplifying Random Satisfiability Problem by Removing Frustrating Interactions},
author = {A. Ramezanpour and S. Moghimi-Araghi},
journal= {arXiv preprint arXiv:cond-mat/0606128},
year = {2009}
}
备注
21 pages, 16 figures