3 search results - page 1 / 1 » Understanding Random SAT: Beyond the Clauses-to-Variables Ra... |
CP
2004
Springer
14 years 4 months ago
2004
Springer
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
SAT
2010
Springer
13 years 9 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
JAIR
2000
13 years 10 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...