Simplifying Random Satisfiability Problem by Removing Frustrating Interactions

A. Ramezanpour, S. Moghimi-Araghi

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 algorith…