BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1607
DTSTAMP:20250821T063058Z
SUMMARY:Dot-Product Proofs
DESCRIPTION:Speaker: Prahladh  Harsha (TIFR)\n\nAbstract: \nA dot-product p
 roof is a simple probabilistic proof system in which the verifier decides 
 whether to accept an input vector based on a single linear combination of 
 the entries of the input and a proof vector. In this talk\, I will present
  constructions of linear-size dot-product proofs for circuit satisfiabilit
 y and discuss two kinds of applications: basing the exponential-time hardn
 ess of approximating MAX-LIN (maximal number of linear equations that can 
 be simultaneously satisfied) on the standard exponential-time hypothesis\,
  and minimizing the verification complexity of cryptographic proof systems
 .\n \n[Joint work with Nir Bitansky\, Yuval Ishai\, Ron Rothblum\, and Da
 vid Wu]\n
URL:https://www.tcs.tifr.res.in/web/events/1607
DTSTART;TZID=Asia/Kolkata:20250826T160000
DTEND;TZID=Asia/Kolkata:20250826T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR