An Improved Upper Bound for SAT

Huairui Chu, Mingyu Xiao, Zhe Zhang

We show that the CNF satisfiability problem can be solved $O^{\ast }(1.2226^m)$ time, where $m$ is the number of clauses in the formula, improving the known upper bounds $O^{\ast }(1.234^m)$ g…