Slide 1 Subhash Khot’s work and its impact Sanjeev Arora Computer Science Dept, Princeton University ICM 2014 Nevanlinna Prize Laudatio Slide 2 Main points from Nevanlinna…
A 3-Query PCP over integers a.k.a Solving Sparse Linear Systems Prasad Raghavendra Venkatesan Guruswami Linear Equations Given a system of linear equations over reals, Find…
On the Unique Games Conjecture Subhash Khot Georgia Inst. Of Technology. At FOCS 2005 NP-hard Problems Vertex Cover MAX-3SAT Bin-Packing Set Cover Clique MAX-CUT ……………..…
Constraint Satisfaction, Semidefinite Programming and the Unique Games Conjecture Prasad Raghavendra University of Washington Seattle Optimal Algorithms and Inapproximability…
Constraint Satisfaction, Semidefinite Programming and the Unique Games Conjecture Prasad Raghavendra University of Washington Seattle Optimal Algorithms and Inapproximability…
Slide 1 Introduction to PCP and Hardness of Approximation Dana Moshkovitz Princeton University and The Institute for Advanced Study 1 Slide 2 This Talk A Groundbreaking Discovery!…
Vol.1: Geometry Subhash Khot IAS Elchanan Mossel UC Berkeley Guy Kindler DIMACS Ryan O’Donnell IAS We show: It is impossible to improve the MAX-CUT approximation of Goemans…
CS 473g Algorithmsx Sariel Har-Peled December 10, 2007 This work is licensed under the Creative Commons Attribution-Noncommercial 3.0 License. To view a copy of this license,…