Compressed Matrix Multiplication

Rasmus Pagh

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review


Motivated by the problems of computing sample covariance matrices, and of transforming a collection of vectors to a basis where they are sparse, we present a simple algorithm that computes an approximation of the product of two n-by-n real matrices A and B.
Original languageEnglish
Article number9
JournalACM Transactions on Computation Theory
Issue number3
Publication statusPublished - Aug 2013


  • algorithm
  • matrix
  • matrix-multiplication


Dive into the research topics of 'Compressed Matrix Multiplication'. Together they form a unique fingerprint.

Cite this