CS 6520 - Computational Complexity Fall 2015
Wednesday, November 4, 2015
Lecture 32
Continuation of PCP proof. Laid out the three lemmas: Preprocessing (Lemma 1.9 in Dinur's paper), Amplification and Composition. Gave construction of the first phase of the preprocessing lemma (Def 4.1).
Newer Post
Older Post
Home