Compressed matrix multiplication

Rasmus Pagh
2013 ACM Transactions on Computation Theory  
We present a simple algorithm that approximates the product of n-by-n real matrices A and B. Let ||AB|| F denote the Frobenius norm of AB, and b be a parameter determining the time/accuracy trade-off. Given 2-wise independent hash functions h 1 , h 2 : [n] → [b], and s 1 , s 2 : [n] → {−1, +1} the algorithm works by first "compressing" the matrix product into the polynomial
doi:10.1145/2493252.2493254 fatcat:gdrdqudlsjgn5jg6mjfiqa4hg4