Monotone 3-Sat-4 is NP-complete
Computational Complexity
2016-03-28 v1
Abstract
Monotone 3-Sat-4 is a variant of the satisfiability problem for boolean formulae in conjunctive normal form. In this variant, each clause contains exactly three literals---either all or none of them are positive, i.e., no clause contains both a positive and a negative literal---and every variable appears at most four times in the formula. Moreover, every clause consists of three distinct literals. We show that Monotone 3-Sat-4 is NP-complete.
Cite
@article{arxiv.1603.07881,
title = {Monotone 3-Sat-4 is NP-complete},
author = {Andreas Darmann and Janosch Döcker},
journal= {arXiv preprint arXiv:1603.07881},
year = {2016}
}