Slide 1Tight integrality gaps for vertex-cover semidefinite relaxations in the Lovász-Schrijver Hierarchy Avner Magen Joint work with Costis Georgiou, Toni Pitassi and Iannis…

Slide 1 Making proof-based verified computation almost practical Michael Walfish The University of Texas at Austin Slide 2 The motivation is 3 rd party computing: cloud,…

Slide 1 Probabilistically Checkable Proofs Madhu Sudan MIT CSAIL 09/23/20091Probabilistic Checking of Proofs TexPoint fonts used in EMF. Read the TexPoint manual before you…

Slide 1 Umans Complexity Theory Lectures Lecture 15: Approximation Algorithms and Probabilistically Checkable Proofs (PCPs) Slide 2 2 New topic(s) Optimization problems,…

Slide 1 Making argument systems for outsourced computation practical (sometimes) Srinath Setty, Richard McPherson, Andrew J. Blumberg, and Michael Walfish The University…

Probabilistically Checkable Proofs Madhu Sudan MIT CSAIL Can Proofs Be Checked Efficiently? Proofs and Theorems Conventional belief: Proofs need to be read carefully to be…

Making argument systems for outsourced computation practical (sometimes) Verifying remote executions: from wild implausibility to near practicality Michael Walfish NYU and…

Tight integrality gaps for vertex-cover semidefinite relaxations in the Lovász-Schrijver Hierarchy Avner Magen Joint work with Costis Georgiou, Toni Pitassi and Iannis Tourlakis…

Simple PCPs Probabilistically Checkable Proofs Madhu Sudan MIT CSAIL 09/23/2009 1 Probabilistic Checking of Proofs TexPoint fonts used in EMF. Read the TexPoint manual before…

Making argument systems for outsourced computation practical (sometimes) Making argument systems for outsourced computation practical (sometimes) Srinath Setty, Richard McPherson,…