Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Exploiting independent subformulas: A faster approximation scheme for #k-SAT
Information Processing Letters
Strong ETH holds for regular resolution
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The PPSZ algorithm by Paturi, Pudl\'ak, Saks, and Zane [1998] is the fastest known algorithm for Unique k-SAT, where the input formula does not have more than one satisfying assignment. For k=5 the same bounds hold for general k-SAT. We show that this is also the case for k=3,4, using a slightly modified PPSZ algorithm. We do the analysis by defining a cost for satisfiable CNF formulas, which we prove to decrease in each PPSZ step by a certain amount. This improves our previous best bounds with Moser and Scheder [2011] for 3-SAT to O(1.308^n) and for 4-SAT to O(1.469^n).