Login / Signup

Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture.

Monika HenzingerSebastian KrinningerDanupon NanongkaiThatchaphol Saranurak
Published in: STOC (2015)
Keyphrases
  • np complete
  • real time
  • online learning
  • dynamic environments
  • vector space
  • problems involving
  • website
  • similarity measure
  • feature vectors
  • special case
  • np hard
  • least squares
  • optimization problems
  • solving problems