48 citations · 67 across the 2 of their papers we have counts for
2 papers
cond-mat.stat-mech2002★ 19 cited
Complexity transitions in global algorithms for sparse linear systems over finite fields
A. Braunstein, M. Leone, F. Ricci-Tersenghi +1
We study the computational complexity of a very basic problem, namely that of finding solutions to a very large set of random linear equations in a finite Galois Field modulo q. Us…
cond-mat.dis-nn2001★ 48 cited
Phase coexistence and finite-size scaling in random combinatorial problems
M. Leone, F. Ricci-Tersenghi, R. Zecchina
We study an exactly solvable version of the famous random Boolean satisfiability problem, the so called random XOR-SAT problem. Rare events are shown to affect the combinatorial ``…