Faster Online Matrix-Vector Multiplication
From MaRDI portal
Publication:4575890
DOI10.1137/1.9781611974782.142zbMath1410.68409arXiv1605.01695OpenAlexW2345605959MaRDI QIDQ4575890
Kasper Green Larsen, R. Ryan Williams
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.01695
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases ⋮ Upper and Lower Bounds for Dynamic Data Structures on Strings ⋮ Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ Dynamic data structures for interval coloring ⋮ Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors ⋮ Unnamed Item
This page was built for publication: Faster Online Matrix-Vector Multiplication
