New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science - Complexity and logic
Faster exact solutions for some NP-hard problems
Theoretical Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Algorithms for four variants of the exact satisfiability problem
Theoretical Computer Science
New algorithms for exact satisfiability
Theoretical Computer Science
Finding diverse and similar solutions in constraint programming
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Algorithms for the maximum hamming distance problem
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Reasoning about optimal collections of solutions
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
| Hi-index | 0.01 |
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.