Documents Probabilistically Checkable Proofs (and inapproximability) Irit Dinur, Weizmann open day, May 1 st.....

Slide 1 Probabilistically Checkable Proofs (and inapproximability) Irit Dinur, Weizmann open day, May 1 st 2009 Slide 2 How Efficiently Can Proofs Be Checked ? P  NP (12…

Documents Lecture Notes

Advanced Algorithms Lecture Notes Periklis A. Papakonstantinou Fall 2011 Preface This is a set of lecture notes for the 3rd year course “Advanced Algorithms” which I…

Documents PCP and Inapproximability Irit Dinur NEC. Example: the Minimum Vertex Cover functionExample: the...

PCP and Inapproximability Irit Dinur NEC Example: the Minimum Vertex Cover function Facts: 1. Best algorithm runs in time (1.21)n [Robson ‘86] 2. VC is NP-hard. [Karp ’72]…

Documents P robabilistically C heckable P roofs (and inapproximability)

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…