Dealing With 4-Variables by Resolution: An Improved MaxSAT Algorithm
Data Structures and Algorithms
2015-03-11 v1
Abstract
We study techniques for solving the Maximum Satisfiability problem (MaxSAT). Our focus is on variables of degree 4. We identify cases for degree-4 variables and show how the resolution principle and the kernelization techniques can be nicely integrated to achieve more efficient algorithms for the MaxSAT problem. As a result, we present an algorithm of time for the MaxSAT problem, improving the previous best upper bound by Ivan Bliznets and Alexander.
Cite
@article{arxiv.1503.02920,
title = {Dealing With 4-Variables by Resolution: An Improved MaxSAT Algorithm},
author = {Jianer Chen and Chao Xu},
journal= {arXiv preprint arXiv:1503.02920},
year = {2015}
}