Logic and Proof MT24, XOR-Clauses
Flashcards
@Describe the idea behind showing that the satisfiability problem for conjunctions of XOR-clauses can be solved in polynomial time.
Reduce to a system of equations over $\mathbb Z _ 2$ and solve via Gaussian elimination.