1 citations · 1 across the 1 of their papers we have counts for
1 paper
S. Cocco, R. Monasson
The analysis of the solving complexity of random 3-SAT instances using the Davis-Putnam-Loveland-Logemann (DPLL) algorithm slightly below threshold is presented. While finding a so…