Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
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 , while the rest are all ass…
cs.DS2020
A Faster Exact Algorithm to Count X3SAT Solutions
Gordon Hoi, Sanjay Jain, Frank Stephan
The Exact Satisfiability problem, XSAT, is defined as the problem of finding a satisfying assignment to a formula in CNF such that there is exactly one literal in each clause assig…