Explore advanced algorithms and conditional lower bounds for dynamic matrix inverse in this 18-minute IEEE conference talk. Delve into the latest research presented by Jan van den Brand, Danupon Nanongkai, and Thatchaphol Saranurak as they discuss improved techniques and theoretical limitations in the field of dynamic matrix computations.
Dynamic Matrix Inverse - Improved Algorithms and Matching Conditional Lower Bounds
Overview
Syllabus
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
Dynamic Approximate Shortest Paths and Beyond - Subquadratic and Worst Case Update Time
-
Conditional Hardness for Massively Parallel Computing Via Distributed Lower Bounds
-
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
-
Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds
-
Recent Progress on Sublinear Time Algorithms for Maximum Matching - Lower Bounds
-
Approximation Algorithms for LCS and LIS with Truly Improved Running Times
