1
$\begingroup$

1-OR-3-SAT:

Input: 3-CNF formula $\varphi$

Question: whether there is an assignment $x$ such that in each clause there are one or three true literals.

I need to show that this problem is in $P$. I tried to construct a reduction from this problem to 2-SAT that is in $P$. What can I try here?

$\endgroup$
2
$\begingroup$

Hint:

Can you express the clause in modular arithmetic?

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.