satisfiability_weighted_monotone_cnf (257B)
1 # Satisfiability weighted monotone CNF 2 3 Given a [monotone_cnf] and weight k, decide if there is a satisfying assignment of [hamming_weight] at most k 4 5 It is [np_hard] by immediate reduction from [vertex_cover] 6 7 Up: [satisfiability_weighted], [monotone_cnf]