1_or_3_in_3_sat (362B)
1 # 1_or_3_in_3_sat 2 3 Variant of [satisfiability_boolean] where each clause contains exactly 3 literals and you want a valuation such that each clause has 1 or 3 true literals 4 5 It is in fact [ptime] because it is [affine] 6 7 https://cstheory.stackexchange.com/questions/53268/complexity-of-1-or-3-in-3-sat-odd-3-sat 8 9 Up: [schaefers_dichotomy_theorem], [sat_variants]