A duality between clause width and clause density for SAT

We consider the relationship between the complexities of k-SAT and those of SAT restricted to formulas of constant density. Let s_k be the infimum of those c ges 0 such that k-SAT on n variables can be decided in time O(2^cn) and d_Delta be the infimum of those c ges 0 such that SAT on n variables and les Deltan clauses can be decided in time O(2^cn). We show that lim_krarrinfin s_k = lim_{Deltararrinfin}d_Delta. So, for any epsi > 0, k-SAT can be solved in 2^(1-epsi)n time independent of k if and only if the same is true for SAT with any fixed density of clauses to variables. We derive some interesting consequences from this. For example, assuming that 3-SAT is exponentially hard (that is, s₃ > 0), SAT of any fixed density can be solved in time whose exponent is strictly less than that for general SAT. We also give an improvement to the sparsification lemma of Impagliazzo et al. (1998) showing that instances of k-SAT of density slightly more than exponential in k are almost the hardest instances of k-SAT. The previous result showed this for densities doubly exponential in k