## Lecture 4: Proof that PCP Theorem is equivalent to hardness of Gap-Max-SAT

In today’s lecture, I proved that the PCP theorem is equivalent to the fact that

- Gap-MaxE3SAT is NP-Hard for some constant

From the fact, it’s easy to show that

- MaxE3SAT is NP-Hard to approximate to within some constant

I also outlined things that will be discussed about expanders.

leave a comment