Algorithms for max Hamming exact satisfiability

Abstract

We here study MAX HAMMING XSAT, i.e., the problem of finding two XSAT models at maximum Hamming distance. By using a recent XSAT solver as an auxiliary function, an O(2n) time algorithm can be constructed, where n is the number of variables. This upper time bound can be further improved to O(1.8348n) by introducing a new kind of branching, more directly suited for finding models at maximum Hamming distance. The techniques presented here are likely to be of practical use as well as of theoretical value, proving that there are non-trivial algorithms for maximum Hamming distance problems. © Springer-Verlag Berlin Heidelberg 2005.