16 search results - page 4 / 4 » Lower bounds for k-DNF resolution on random 3-CNFs |
SAT
2009
Springer
13 years 11 months ago
2009
Springer
We investigate the role of cycles structures (i.e., subsets of clauses of the form ¯l1 ∨ l2, ¯l1 ∨ l3, ¯l2 ∨ ¯l3) in the quality of the lower bound (LB) of modern MaxSAT ...