XSAT and NAE-SAT are important variants of the propositional satisfiability problem (SAT). Both are studied here regarding their computational complexity of linear CNF formulas. We prove that both variants remain NP-complete for (monotone) linear formulas yielding the conclusion that also bicolorability of linear hypergraphs is NP-complete. The reduction used gives rise to the complexity investigation of both variants for several monotone linear subclasses that are parameterized by the size of clauses or by the number of occurrences of variables. In particular cases of these parameter values we are able to verify the NP-completeness of XSAT respectively NAE-SAT; though we cannot provide a complete treatment. Finally we focus on exact linear formulas where clauses intersect pairwise, and for which SAT is known to be polynomial-time solvable [1]. We verify the same assertion for NAE-SAT relying on a result in [2]; whereas we obtain NP-completeness for XSAT of exact linear formulas. The case of uniform clause size k remains open for the latter problem. However, we can provide its polynomial-time behavior for k at most 6.

No abstract

No abstract

No abstract