Further Improvements for SAT in Terms of Formula Length

Junqiang Peng, Mingyu Xiao

In this paper, we prove that the general CNF satisfiability problem can be solved in $O^{\ast }(1.0638^L)$ time, where $L$ is the length of the input CNF-formula (i.e., the total number…