On the parallel parameterized complexity of MaxSAT variants

DOI10.4230/LIPICS.SAT.2022.19MaRDI QIDQ6572033zbMATH OpenFDO

Authors Max Bannach, Malte Skambath, Till Tantau

Publication date 12 July 2024

zbMATH Keywords

fixed-parameter tractabilityparallel algorithmsMaxSATalmost-SAT

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07)

Cited in

(1)

• On the parallel parameterized complexity of MaxSAT variants

This page was built for publication: On the parallel parameterized complexity of MaxSAT variants

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