JAIR
2000
13 years 11 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
RSA
2006
13 years 11 months ago
2006
: Using the cavity equations of M
CORR
2010
Springer
13 years 11 months ago
2010
Springer
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...