6 search results - page 1 / 2 » Approximating the unsatisfiability threshold of random formu... |
RSA
1998
13 years 10 months ago
1998
CORR
2010
Springer
13 years 11 months ago
2010
Springer
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...
AAAI
2008
14 years 1 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
CORR
2006
Springer
13 years 11 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 ...
STOC
2010
ACM
14 years 8 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...