scientific article; zbMATH DE number 7650314

DOI10.4230/LIPICS.FSTTCS.2019.17MaRDI QIDQ5875650zbMATH OpenFDO

Authors Gordon Hoi, Sanjay Jain, Frank Stephan

Publication date 3 February 2023

Full work available at URL https://arxiv.org/abs/1910.01293

zbMATH Keywords

DPLL algorithmsexponential time algorithmsmaximum Hamming distance of solutionsX3SAT problem

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Recommendations

• Measure and Conquer for Max Hamming Distance XSAT
• Algorithms and Computation
• Recent Advances in Constraints
• A linear-time algorithm for Hamming distance with shifts
• scientific article; zbMATH DE number 1305511
• On the Hamming distance of constraint satisfaction problems.
• An approximation algorithm for MAX 3-SAT
• Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
• On the Hamming distance in combinatorial optimization problems on hypergraph matchings

Cited in

(1)

• On the parameterized complexity of diverse SAT

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875650)