Sub-exponential Upper Bound for #XSAT of some CNF Classes
Computational Complexity
2018-03-21 v1
Abstract
We derive an upper bound on the number of models for exact satisfiability (XSAT) of arbitrary CNF formulas F. The bound can be calculated solely from the distribution of positive and negated literals in the formula. For certain subsets of CNF instances the new bound can be computed in sub-exponential time, namely in at most O(exp(sqrt(n))) , where n is the number of variables of F. A wider class of SAT problems beyond XSAT is defined to which the method can be extended.
Cite
@article{arxiv.1803.07376,
title = {Sub-exponential Upper Bound for #XSAT of some CNF Classes},
author = {Bernd Schuh},
journal= {arXiv preprint arXiv:1803.07376},
year = {2018}
}