ינואר 09, 1996 - ינואר 09, 2029

  • Date:09שנייוני 2025

    Foundations of Computer Science Seminar

    More information
    שעה
    11:15 - 12:15
    כותרת
    Size Efficient PCPs and Fault-tolerant Routing via HDX
    מיקום
    בניין יעקב זיסקינד
    Room 1 - 1 חדר
    מרצהDor Minzer
    MIT
    מארגן
    המחלקה למדעי המחשב ומתמטיקה שימושית
    צרו קשר
    תקצירShow full text abstract about We will discuss recent PCP constructions based on high-dimen...»
    We will discuss recent PCP constructions based on high-dimensional expanders that achieve small soundness and quasi-linear size, which are two key properties of PCPs.

    To do so we discuss the idea of "derandomized hardness amplification", which is a soundness amplifying procedure that only incurs a mild size blow-up, and show how to achieve it (in the context of PCPs) via high-dimensional expanders. 

    No special background will be assumed.

    Based on joint works with Mitali Bafna, Noam Lifshitz, Nikhil Vyas and Zhiwei Yun
    הרצאה