25 search results - page 1 / 5 » sat 2011 |
ESA
2011
Springer
12 years 4 months ago
2011
Springer
SAT
2011
Springer
12 years 7 months ago
2011
Springer
Failed literal detection (FL) in SAT is a powerful approach for preprocessing. The basic idea is to assign a variable as assumption. If boolean constraint propagation (BCP) yields ...
DISOPT
2011
13 years 19 hour ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
CORR
2011
Springer
13 years 1 days ago
2011
Springer
CORR
2011
Springer
12 years 8 months ago
2011
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...