XSAT of Exact Linear CNF Classes

11/20/2017 ∙ by Bernd. R. Schuh, et al. ∙ 0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.