Josh Alman. Algorithms and Barriers for Fast Matrix Multiplication
About this video
Advanced · Editorial review · 85% confidenceNew channel Georgetown Computer Science Colloquium: title sample judged 'whole' (Academic colloquium talks by expert researchers presenting technical CS research, all genuinely educational expert techn); passed a second screen for sellers/exam-prep/re-uploads; 3 of 3 sampled transcripts showed teaching, 0 not; every title checked strictly; oEmbed verified.
A 52-minute video from Georgetown Computer Science Colloquium: “Josh Alman. Algorithms and Barriers for Fast Matrix Multiplication”.
Video by Georgetown Computer Science Colloquium, played through YouTube's embedded player.