Measure and Conquer for Max Hamming Distance XSAT

DOI10.4230/LIPICS.ISAAC.2019.15MaRDI QIDQ5875576zbMATH OpenOpenAlexFDO

Authors Gordon Hoi, Frank Stephan

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPIcs.ISAAC.2019.15

zbMATH Keywords

DPLLexponential time algorithmsmeasure and conquerXSAT

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• scientific article; zbMATH DE number 7650314 (Why is no real title available?)
• On the parameterized complexity of diverse SAT
• On the parameterized complexity of diverse SAT

This page was built for publication: Measure and Conquer for Max Hamming Distance XSAT

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