Loading...
Simplifying random satisfiability problems by removing frustrating interactions
Ramezanpour, A ; Sharif University of Technology | 2006
203
Viewed
- Type of Document: Article
- DOI: 10.1103/PhysRevE.74.041105
- Publisher: 2006
- Abstract:
- How can we remove some interactions (generate shorter clauses) 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 directly provide the solutions of the original problem. © 2006 The American Physical Society
- Keywords:
- Constraint satisfaction problem (CSP) ; Interactions ; Random satisfiability ; Algorithms ; Mathematical models ; Random processes ; Problem solving
- Source: Physical Review E - Statistical, Nonlinear, and Soft Matter Physics ; Volume 74, Issue 4 , 2006 ; 15393755 (ISSN)
- URL: https://journals.aps.org/pre/abstract/10.1103/PhysRevE.74.041105