BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260408T090212Z
UID:Seminar-pizza-1346@lxserverA.csc.liv.ac.uk.csc.liv.ac.uk
ORGANIZER:CN=Qiyi Tang:MAILTO:Qiyi.Tang@liverpool.ac.uk
DTSTART:20260227T130000
DTEND:20260227T140000
SUMMARY:Friday Lunch and Talk Series
DESCRIPTION:Karteek Sreenivasaiah: Boolean circuits, and locally verifiable proofs.\n\nI will start with a very brief, but gentle introduction to Boolean circuits and circuit complexity. Following this, I will define the notion of 'locally verifiable proofs' using circuits and give a 'proof by picture' for a theorem regarding connectivity of two vertices in a graph. I will also highlight one open problem in this context about regular languages.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1346
LOCATION:ALT
END:VEVENT
END:VCALENDAR