Probabilistically Checkable Proofs (and inapproximability) Irit Dinur, Weizmann open day, May 1st 2009 How Efficiently Can Proofs Be Checked? (slide by Madhu Sudan) our real…
