Exploiting Independent Subformulas: A Faster Approximation Scheme for #k-SAT
arXiv:1302.6900 · doi:10.1016/j.ipl.2013.02.013
Abstract
We present an improvement on Thurley's recent randomized approximation scheme for #k-SAT where the task is to count the number of satisfying truth assignments of a Boolean function Φ given as an n-variable k-CNF. We introduce a novel way to identify independent substructures of Φ and can therefore reduce the size of the search space considerably. Our randomized algorithm works for any k. For #3-SAT, it runs in time O(ε^{-2}*1.51426^n), for #4-SAT, it runs in time O(ε^{-2}*1.60816^n), with error bound ε.
arXiv commentImproves: arXiv:1107.2001