BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Iowa State University CALS LAS Web Team//sites.iastate.edu//EN
BEGIN:VEVENT
UID:20261007T212500-4991-www.cs.iastate.edu
DTSTART:20261007T212500Z
SEQUENCE:0
TRANSP:OPAQUE
DTEND:20261007T222500Z
LOCATION:Hoover Hall\, Room 1213: https://www.fpm.iastate.edu/maps/building
 s/building.asp?id=163
SUMMARY:CS Colloquium: Matrix Multiplication and Its Verification
CLASS:PUBLIC
DESCRIPTION:AbstractMatrix multiplication is one of the most fundamental op
 erations in computing and lies at the heart of modern artificial intellige
 nce. How quickly can we multiply two matrices\, and how much easier is it 
 to check that their product is correct?In this talk\, we will explore thes
 e questions through the lens of sparsity\, examining how promises about th
 e number of nonzero entries can lead to faster algorithms. Along the way\,
  we will develop fast randomized algorithms for multiplying matrices\, det
 erministic algorithms for verifying matrix products under suitable sparsit
 y promises\, and uncover some surprising connections to computational comp
 lexity. The talk is intended for a general computer science audience.\n\nM
 ore information at: https://www.cs.iastate.edu/event/2026/cs-colloquium-ma
 trix-multiplication-and-its-verification\n\nHoover Hall\, Room 1213: https
 ://www.fpm.iastate.edu/maps/buildings/building.asp?id=163
DTSTAMP:20261007T073047Z
END:VEVENT
END:VCALENDAR