Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
Work
Year: 2015
Type: preprint
Abstract: Consider the following Online Boolean Matrix-Vector Multiplication problem: We are given an n x n matrix M and will receive n column-vectors of size n, denoted by v1, ..., vn, one by one. After seeing... more
Institutions University of Vienna, KTH Royal Institute of Technology
Cites: 60
Cited by: 227
Related to: 10
Citation percentile (by year/subfield): 99.97
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder European Research Council
Grant ID 340506