194 citations · 442 across the 9 of their papers we have counts for
Showing 2002Show all
2 papers · 1 filter
cond-mat.stat-mech2002★ 194 cited
Coloring random graphs
R. Mulet, A. Pagnani, M. Weigt +1
We study the graph coloring problem over random graphs of finite average connectivity . Given a number of available colors, we find that graphs with low connectivity admit a…
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…