Vertex-Cover Inapproximability Irit Dinur NEC, Princeton Based on joint work with Muli Safra.
Probabilistically Checkable Proofs (and inapproximability) Irit Dinur, Weizmann open day, May 1 st 2009.
P robabilistically C heckable P roofs (and inapproximability)