1-in-3 SAT is the set of 3CNF formulas with no negated variables such thatthere is a satisfying assignment that makes exactly one variable in each clause true. Show 1-in-3 SAT is NP-completePlan on doing a reduction from 3SAT.My confusion arises from the no negated variables. You need some way of representing negated variables. How do you do that? I can do the reduction from 3SAT to 1-in-3 SAT without the restraint that there are no negated variables. I'm just not sure how to do it with this constraint.
Show 1-in-3 SAT
np complete