194 citations · 218 across the 4 of their papers we have counts for
4 papers
Algorithmic thresholds in combinatorial optimization depend on the time scaling
M. C. Angelini, M. Avila-González, F. D'Amico +3
In the last decades, many efforts have focused on analyzing typical-case hardness in optimization and inference problems. Some recent work has pointed out that polynomial algorithm…
Local equations describe unreasonably efficient stochastic algorithms in random K-SAT
David Machado, Jonathan González-García, Roberto Mulet
Despite significant advances in characterizing the highly nonconvex landscapes of constraint satisfaction problems, the good performance of certain algorithms in solving hard combi…
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…
Against temperature chaos in naive Thouless-Anderson-Palmer equations
R. Mulet, A. Pagnani, G. Parisi
We study the temperature structure of the naive TAP equations by mean of a recursion algorithm. The problem of the chaos in temperature is addressed using the notion of the tempera…