## Approximating E3-LIN is NP-Hard

This lecture, which I gave for my 18.434 seminar, focuses on the MAX-E3LIN problem. We prove that approximating it is NP-hard by a reduction from LABEL-COVER. 1. Introducing MAX-E3LIN In the MAX-E3LIN problem, our input is a series of linear equations \$latex {\pmod 2}&fg=000000\$ in \$latex {n}&fg=000000\$ binary variables, each with three terms. Equivalently, one… Continue reading Approximating E3-LIN is NP-Hard