New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science - Complexity and logic
A Probabilistic 3-SAT Algorithm Further Improved
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Worst-case time bounds for coloring and satisfiability problems
Journal of Algorithms
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Finding diverse and similar solutions in constraint programming
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Distance constraints in constraint satisfaction
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Reasoning about optimal collections of solutions
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Algorithms for max hamming exact satisfiability
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Hi-index | 0.00 |
We study the problem of finding two solutions to a constraint satisfaction problem which differ on the assignment of as many variables as possible – the Max Hamming Distance problem for CSPs – a problem which can, among other things, be seen as a domain independent way of quantifying “ignorance.” The first algorithm we present is an $\mathcal{O}(1.7338^n)$ microstructure based algorithm for Max Hamming Distance 2-SAT, improving the previously best known algorithm for this problem, which has a running time of $\mathcal{O}(1.8409^n)$. We also give algorithms based on enumeration techniques for solving both Max Hamming Distancel-SAT, and the general Max Hamming Distance (d,l)-CSP, the first non-trivial algorithms for these problems. The main results here are that if we can solve l-SAT in $\mathcal{O}(a^n)$ and (d,l)-CSP in $\mathcal{O}(b^n)$, then the corresponding Max Hamming problems can be solved in $\mathcal{O}((2a)^n)$ and $\mathcal{O}(b^n(1+b)^n)$, respectively.