BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Group-theoretic Algorithms for Matrix Multiplication 
DTSTART:20100624T091500
DTSTAMP:20260406T225937Z
UID:1808bab1bc4f2a92b637ffa1aff970f3fc0a05283d02db9a8ad53fa4
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Chris Umans. California Institute of Technology\nWe pres
 ent a group-theoretic approach to producing fast algorithms for matrix mul
 tiplication. In this framework\, one devises algorithms by constructing no
 n-abelian groups with certain properties. The algorithms themselves are na
 tural and make use of the discrete Fourier transform over these groups.\n\
 nWe construct several families of groups that achieve matrix multiplicatio
 n exponent significantly less than 3 (but not better than the current best
  bound\, 2.376...). This leads to two appealing conjectures\, one combinat
 orial and the other algebraic. Either one would imply that the exponent of
  matrix multiplication is 2.\n\nThis is joint work with Henry Cohn\, Bobby
  Kleinberg\, and Balazs Szegedy. \n  Prof. Umans' homepage
LOCATION:BC 01 https://plan.epfl.ch/?room==BC%2001
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR