Login / Signup
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture.
Monika Henzinger
Sebastian Krinninger
Danupon Nanongkai
Thatchaphol Saranurak
Published in:
CoRR (2015)
Keyphrases
</>
problems involving
real time
benchmark problems
typical testors
dot product
sparse matrix
decision problems
dynamic environments
data sets
information theoretic
online learning
phase transition
optimization problems
floating point
np hardness
worst case
matrix representation
feature vectors