Algorithms for Max Hamming Exact Satisfiability

Vilhelm Dahllof

We here study Max Hamming XSAT, ie, the problem of finding two XSAT models at maximum Hamming distance. By using a recent XSAT solver as an auxiliary function, an O(1.911^n) time a…