Algorithms for the Maximum Hamming Distance problem
From MaRDI portal
Recommendations
Cited in
(9)- On the Hamming distance of constraint satisfaction problems.
- Leprechauns on the chessboard
- scientific article; zbMATH DE number 7650314 (Why is no real title available?)
- Algorithms and Computation
- On the parameterized complexity of diverse SAT
- Exact approaches for the diverse satisfiability problem
- On the parameterized complexity of diverse SAT
- Algorithms for the diverse-k-SAT problem: the geometry of satisfying assignments
- Some computational aspects of DISTANCE SAT
This page was built for publication: Algorithms for the Maximum Hamming Distance problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703899)