Improved Algorithms for the General Exact Satisfiability Problem

Gordon Hoi, Frank Stephan

The Exact Satisfiability problem asks if we can find a satisfying assignment to each clause such that exactly one literal in each clause is assigned $1$, while the rest are all ass…