265 citations · 2.3k across the 48 of their papers we have counts for
Showing 2000Show all
2 papers · 1 filter
cond-mat.stat-mech2000★ 83 cited
Analysis of the computational complexity of solving random satisfiability problems using branch and bound search algorithms
Simona Cocco, Remi Monasson
The computational complexity of solving random 3-Satisfiability (3-SAT) problems is investigated. 3-SAT is a representative example of hard computational tasks; it consists in know…
cond-mat.dis-nn2000★ 94 cited
Trajectories in phase diagrams, growth processes and computational complexity: how search algorithms solve the 3-Satisfiability problem
Simona Cocco, Remi Monasson
Most decision and optimization problems encountered in practice fall into one of two categories with respect to any particular solving method or algorithm: either the problem is so…