Slide 1How to Round Any CSP Prasad Raghavendra University of Washington, Seattle David Steurer, Princeton University (In Principle) Slide 2 Constraint Satisfaction Problem…

Slide 1Inapproximability of MAX-CUT Khot,Kindler,Mossel and O ’ Donnell Moshe Ben Nehemia June 05 Slide 2 Main Result  It is NP-Hard problem to approximate MAX-CUT to…

Slide 1 Slide 2 The Max-Cut problem: Election recounts? Majority vs. Electoral College? 7812 Slide 3 The 2-Lin(mod 3) problem: Simultaneously satisfy as many as you can.…

Slide 1On the Unique Games Conjecture Subhash Khot Georgia Inst. Of Technology. At FOCS 2005 Slide 2 NP-hard Problems Vertex Cover MAX-3SAT Bin-Packing Set Cover Clique MAX-CUT…

Slide 1Approximating NP-hard Problems Efficient Algorithms and their Limits Prasad Raghavendra University of Washington Seattle Slide 2 Max 3 SAT Find an assignment that…

Slide 1Prasad Raghavendra University of Washington Seattle Optimal Algorithms and Inapproximability Results for Every CSP? Slide 2 Constraint Satisfaction Problem A Classic…

Slide 1 Games, Proofs, Norms, and Algorithms Boaz Barak – Microsoft Research Based (mostly) on joint works with Jonathan Kelner and David Steurer Slide 2 This talk is about…

Slide 1 A 3-Query PCP over integers a.k.a Solving Sparse Linear Systems Prasad Raghavendra Venkatesan Guruswami Slide 2 Linear Equations Given a system of linear equations…

Slide 1 Gillat Kol joint work with Ran Raz Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist Slide 2 Summary The Unique Games Conjecture (UGC)…

Slide 1 Ryan O'Donnell (CMU, IAS) Yi Wu (CMU, IBM) Yuan Zhou (CMU) Slide 2 Solving linear equations Given a set of linear equations over reals, is there a solution satisfying…