Скачать
A&C Seminar: Robert Andrews - On Matrix Multiplication and Polynomial Identity Testing
Автор: U Waterloo A&C Seminar
Загружено: 2022-12-14
Просмотров: 79
Описание: Determining the complexity of matrix multiplication is a fundamental problem of theoretical computer science. It is popularly conjectured that ω, the matrix multiplication exponent, equals 2. If true, this conjecture would yield fast algorithms for a wide array of problems in linear algebra and beyond. If instead ω is larger than 2, can we leverage the hardness of matrix multiplication to design algorithms for other problems? In this talk, I will describe how lower bounds on ω can be used to make progress on derandomizing polynomial identity testing.
Не удается загрузить Youtube-плеер. Проверьте блокировку Youtube в вашей сети.
Повторяем попытку...
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
