CS 6520 - Computational Complexity Fall 2015
Monday, November 9, 2015
Lecture 34
Second part of prep that converts bounded degree regular graph to an expander with self-loops (Definition 4.3 and Lemma 4.4 of Dinur).
Construction of Graph Powering for Amplification step (follows after Theorem 1.7 in Dinur).
Newer Post
Older Post
Home