2000 character limit reached
Monotone 3-Sat-4 is NP-complete (1603.07881v1)
Published 25 Mar 2016 in cs.CC
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.