1. XSAT and NAE-SAT of linear CNF classes;Porschen;Discrete Appl. Math.,2014
2. A note on a combinatorial problem, Proc;Ryser;American Math. Soc.,1950
3. Computational complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas;Schmidt,2010
4. B.R. Schuh, A Criterion for “Easiness” of Certain SAT Problems, http://arxiv.org/abs/1707.00118.
5. B.R. Schuh, Sub-exponential Upper Bound for #XSAT of some CNF Classes, https://arxiv.org/abs/1803.07376.