BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20170326T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20171029T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260428T052000Z
UID:57209db7e4e06925141584@ist.ac.at
DTSTART:20170619T160000
DTEND:20170619T171500
DESCRIPTION:Speaker: Irit Dinur\nhosted by Uli Wagner\nAbstract: Sometimes 
 you just don't have enough time to read an entire proof\, a brief scan is 
 all you can afford.\nProbabilistically checkable proofs (PCPs)\, discovere
 d 25 years ago\, guarantee that even a brief scan will find an error if th
 ere is one. PCPs have a variety of implications\, from hardness of compu
 tational optimization all the way to secure cloud computing.\n\nA PCP proo
 f is created by taking a ​normal ​​ proof and splitting it clever
 ly into fragments. The key is a theorem asserting that locally consisten
 t fragments must be coming from a globally correct proof.\nRecently\, a c
 onnection was discovered between PCP “agreement tests” and a concept f
 rom combinatorial topology\, so-called high-dimensional expanders. We wil
 l describe this connection and some future potential directions that it su
 ggests.\n
LOCATION:Raiffeisen Lecture Hall\, Central Building\, ISTA
ORGANIZER:aeller@ist.ac.at
SUMMARY:Irit Dinur: Local to global\, high-dimensional expansion\, and prob
 abilistically checkable proofs
URL:https://talks-calendar.ista.ac.at/events/22
END:VEVENT
END:VCALENDAR