Media Summary: Instructor : Mitali Bafna Affiliation : University of Washington Abstract : The theory of probabilistically checkable proofs ( Program : ICTS Workshop on HDXs and Codes ORGANIZERS : Irit Dinur (The Weizmann Institute of Science Rehovot, Israel), ... Computer Science/Discrete Mathematics Seminar I Topic: Quasi-Linear Size
Efficient Pcps From High Dimensional Expanders - Detailed Analysis & Overview
Instructor : Mitali Bafna Affiliation : University of Washington Abstract : The theory of probabilistically checkable proofs ( Program : ICTS Workshop on HDXs and Codes ORGANIZERS : Irit Dinur (The Weizmann Institute of Science Rehovot, Israel), ... Computer Science/Discrete Mathematics Seminar I Topic: Quasi-Linear Size Mitali Bafna (Harvard), Max Hopkins (UCSD), Tali Kaufman (Bar Ilan University) and Shachar Lovett (UCSD) ... to combinatorial optimization, the development and application of Nati Linial, Hebrew University of Jerusalem
Alex Lubotzky Hebrew University February 12, 2013 An outline of Dinur's iterative proof of the Dana Moshkovitz, University of Texas at Austin Probability, Geometry, and Computation ... Elette Boyle (IDC Herzliya), Henry Corrigan-Gibbs (Stanford University) Irit Dinur, Weizmann Institute Probability, Geometry, and Computation in ... Irit Dinur, Weizmann Institute Probability, Geometry, and Computation in
