演讲人： Renfei Zhou [CMU]
时间： 11:00-12:00, Jul 25, 2025 (Fri)
地点：RM 1-222, FIT Building (//meeting.tencent.com/dm/1suGQN3X1y5V （#腾讯会议：939-634-954）)
内容：
Fast matrix multiplication is one of the most fundamental problems in computer science. We present new algorithms that improve the time complexity of matrix multiplication to $n^{2.371339}$, surpassing the previous bound of $n^{2.372860}$. Our result is the largest improvement to the matrix multiplication exponent since 2010. In this lecture, we will introduce the modern framework for matrix multiplication algorithms and highlight the key ideas in our new algorithms.
个人简介:
Renfei Zhou is a first-year PhD student studying theoretical computer science at CMU, co-advised by William Kuszmaul and Guy Blelloch. He completed his Bachelor's degree in Yao Class at Tsinghua University. He mainly works on classical data structures, especially hash tables and succinct data structures. He is also known for his work on fast matrix multiplication.
