XSAT of Exact Linear CNF Classes

11/20/2017

∙

by   Bernd. R. Schuh, et al.

∙

0

∙

share

It is shown that l-regularity implies k-uniformity in exact linear CNF formulas. Consequences for exact satisfiability of this formula class are discussed. In particular it is proven that XSAT-satisfiabilty can be decided in sub-exponential time, namely O(exp(sqrt(n))), for l-regular exact linear monotone CNF formulas.