Graph Powering Cont.
Graph Powering Cont. PCP proof by Irit Dinur Presentation by: Alon Vekker. Last lecture G’ construction. V’ = V B=C · t C = const. E’ = For every two vertices at distance at most t we have a new edge between them. From last lecture. V. V’ = V. Σ. C(u,v). gap’ ≥ t/O(1)*min(gap,1/t).
318 views • 21 slides