Dealing with 4-variables by resolution: an improved MaxSAT algorithm
From MaRDI portal
Publication:515546
DOI10.1016/j.tcs.2017.01.020zbMath1359.68121arXiv1503.02920OpenAlexW2585244063MaRDI QIDQ515546
Chao Xu, Jianxin Wang, Jian'er Chen
Publication date: 16 March 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.02920
Related Items (3)
Further improvements for SAT in terms of formula length ⋮ Unnamed Item ⋮ A refined branching algorithm for the maximum satisfiability problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact algorithms for dominating set
- Which problems have strongly exponential complexity?
- Improved exact algorithms for MAX-SAT
- Vertex Cover: Further Observations and Further Improvements
- Improved Approximation Algorithms for MAX SAT
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- On the Approximation of Maximum Satisfiability
- New Upper Bounds for Maximum Satisfiability
- A New Algorithm for Parameterized MAX-SAT
- Algorithms – ESA 2005
- A Computing Procedure for Quantification Theory
- STACS 2005
- Faster exact algorithms for hard problems: A parameterized point of view
- On the complexity of \(k\)-SAT
This page was built for publication: Dealing with 4-variables by resolution: an improved MaxSAT algorithm