Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm

DOI10.1007/978-3-319-21840-3_15zbMath1359.68120OpenAlexW1813560150MaRDI QIDQ3449815

Jianxin Wang, Chao Xu, Jian'er Chen

Publication date: 30 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21840-3_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (5)

Improved MaxSAT Algorithms for Instances of Degree 3 ⋮ Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms ⋮ Partition on trees with supply and demand: kernelization and algorithms ⋮ An improved FPT algorithm for almost forest deletion problem ⋮ Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment

This page was built for publication: Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm