73 citations · 73 across the 2 of their papers we have counts for
Showing cond-mat.stat-mechShow all
2 papers · 1 filter
cond-mat.stat-mech2008★ 73 cited
Entropy landscape and non-Gibbs solutions in constraint satisfaction problems
L. Dall'Asta, A. Ramezanpour, R. Zecchina
We study the entropy landscape of solutions for the bicoloring problem in random graphs, a representative difficult constraint satisfaction problem. Our goal is to classify which t…
cond-mat.stat-mech2006
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…