Solving Sparse Linear Systems Faster than Matrix Multiplication
In this paper, we present an algorithm that solves linear systems with sparse coefficient matrices asymptotically faster than matrix multiplication for any ω > 2.
Santosh S. Vempala
Advertisement
Author Archives
Technical Perspective: Modeling High-Dimensional Data
Data in high dimension is difficult to visualize and understand. This has always been the case and is even more apparent now with the availability of large high-dimensional datasets and the need to make sense of them.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved