Sciweavers

APPROX
2004
Springer
125views Algorithms» more  APPROX 2004»
13 years 10 months ago
Strong Refutation Heuristics for Random k-SAT
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
Amin Coja-Oghlan, Andreas Goerdt, André Lan...