CS 6520 - Computational Complexity Fall 2015
Monday, November 2, 2015
Lecture 31
We have begun working through Irit Dinur's
proof of the PCP theorem by gap amplification
. Today we defined constraint graphs, stated the main theorem (Theorem 1.7) and defined expander graphs (Section 2.1).
Newer Post
Older Post
Home