Tight integrality gaps for vertex-cover semidefinite relaxations in the Lovász-Schrijver Hierarchy Avner Magen Joint work with Costis Georgiou, Toni Pitassi.
Making proof-based verified computation almost practical Michael Walfish The University of Texas at Austin.
Probabilistically Checkable Proofs Madhu Sudan MIT CSAIL 09/23/20091Probabilistic Checking of Proofs TexPoint fonts used in EMF. Read the TexPoint manual.
Umans Complexity Theory Lectures Lecture 15: Approximation Algorithms and Probabilistically Checkable Proofs (PCPs)
Making argument systems for outsourced computation practical (sometimes) Srinath Setty, Richard McPherson, Andrew J. Blumberg, and Michael Walfish The.
Of 28 Probabilistically Checkable Proofs Madhu Sudan Microsoft Research June 11, 2015TIFR: Probabilistically Checkable Proofs1.
Probabilistically Checkable Proofs Madhu Sudan MIT CSAIL.
Verifying remote executions: from wild implausibility to near practicality
Avner Magen Joint work with Costis Georgiou, Toni Pitassi and Iannis Tourlakis
Probabilistically Checkable Proofs
Making argument systems for outsourced computation practical (sometimes)