MaxSAT, Max2SAT, and QUBO are mutually reducible in linear time with treewidth preserved up to small constants, giving ETH- and SETH-tight bounds and a 2^treewidth algorithm for QUBO.
Chudak, William G
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LO 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators
MaxSAT, Max2SAT, and QUBO are mutually reducible in linear time with treewidth preserved up to small constants, giving ETH- and SETH-tight bounds and a 2^treewidth algorithm for QUBO.