Faster Parallel Algorithms for Basic Linear Algebra Problems

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=47F-HsNlrPg


Duration: 33:21
208 views
3

Avi Wigderson (Institute for Advanced Study, Princeton)
https://simons.berkeley.edu/talks/avi-wigderson-2024-03-25-0
A Workshop in Honor of Michael Ben-Or



Other Videos By Simons Institute for the Theory of Computing


2024-04-16Some Stories of Graphs and Geometry
2024-04-16Locality in Codes and Computation | Richard M. Karp Distinguished Lecture
2024-04-15Communicating Algorithmic Science to the Public | Theoretically Speaking
2024-04-15The Complexity of Fermions in Quantum Information and Beyond | Richard M. Karp Distinguished Lecture
2024-04-15From Consensus (Back) to Agreement
2024-04-15Holographic Complexity
2024-04-15Michael and I and Two Quantum Tales
2024-04-15Talk by Charles H. Bennett (IBM Research)
2024-04-15Michael Ben-Or Corrects Errors
2024-04-15Information Theoretic MPC: Techniques That Age Well
2024-04-15Faster Parallel Algorithms for Basic Linear Algebra Problems
2024-04-15Tensor Network Toy Models of Holographic Dualities: Locality and Causality
2024-04-15Is It Dark Matter, or Is Spacetime Undergoing a Random Walk?
2024-04-15A Quantum Complexity Approach to the Problem of Weak Cosmic Censorship
2024-04-15Pseudorandomness and Pseudoentanglement in Holography
2024-04-15Pseudoentanglement
2024-04-15Quantum Computational Advantage With Constant-Temperature Gibbs Sampling
2024-04-15Holographic Pseudo Entropy and Emergent Spacetime
2024-04-15What on Earth Does Complexity Theory Have to Do with Gravity?
2024-04-15Expansion of Higher-Dimensional Cubical Complexes With Application To Good ...
2024-04-15The Quantum Games PCP: Results and Confessions


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
A Workshop in Honor of Michael Ben-Or
Avi Wigderson