BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Penn Engineering Events - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Penn Engineering Events
X-ORIGINAL-URL:https://seasevents.nmsdev7.com
X-WR-CALDESC:Events for Penn Engineering Events
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20250218T153000
DTEND;TZID=America/New_York:20250218T163000
DTSTAMP:20260602T160153
CREATED:20250211T010944Z
LAST-MODIFIED:20250211T010944Z
UID:13287-1739892600-1739896200@seasevents.nmsdev7.com
SUMMARY:CIS Seminar: "Efficient Probabilistically Checkable Proofs from High-Dimensional Expanders"
DESCRIPTION:The PCP theorem\, proved in the 90’s\, shows how to encode a proof for any theorem into a format where the theorem’s correctness can be verified by making only a constant number of queries to the proof. This result is a significant milestone in computer science and has important implications for approximation algorithms\, cryptography\, and cloud computing.\nIn this talk\, I will cover some exciting progress on constructing efficient PCPs. My work gives a systematic way to construct PCPs\, improving upon the state-of-the-art PCP constructions from nearly 20 years ago. This implies that many well-known approximation algorithms are nearly-optimal under well-believed complexity-theoretic conjectures. In the process\, we also solve various conjectures in property testing and distributed computing. These advances are facilitated by the newly-emerging theory of high-dimensional expansion and draw upon connections with various areas of theoretical computer science and mathematics.
URL:https://seasevents.nmsdev7.com/event/cis-seminar-efficient-probabilistically-checkable-proofs-from-high-dimensional-expanders/
LOCATION:Amy Gutmann Hall\, Room 414\, 3333 Chestnut Street\, Philadelphia\, 19104\, United States
ORGANIZER;CN="Computer and Information Science":MAILTO:cherylh@cis.upenn.edu
END:VEVENT
END:VCALENDAR