Is this problem NP-complete?I have many restrictions like this and want to find a feasible solution:((a and b) xor (c and d)) = 1with a,b,c,d are arbitrary literals. It looks similar to XOR-2SAT but has additional ANDs inside the clause.
Is SAT-Problem with XOR and AND NP-complete
np complete;satisfiability;2 sat