11 search results - page 3 / 3 » Typical random 3-SAT formulae and the satisfiability thresho... |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...