Understanding the Bit Complexity of Jordan Normal Form & Spectral Factorization 🔍
Explore the computational challenges and efficiency of calculating Jordan Normal Form and spectral factorization, with insights from leading researchers at UC Berkeley, Microsoft, OpenAI, and Georgia Tech.
Simons Institute for the Theory of Computing
833 views • Jan 9, 2023
About this video
Authors: Nikhil Srivastava (UC Berkeley); Ravindran Kannan (Microsoft Reseach India); Nick Ryder (OpenAI); Papri Dey (Georgia Tech)
ITCS - Innovations in Theoretical Computer Science
ITCS - Innovations in Theoretical Computer Science
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
833
Likes
15
Duration
24:54
Published
Jan 9, 2023