2003/07/08 by Vince Grolmusz, Grolmusz, Vince
Computer Science · #Computational Complexity (cs.CC) #F.1 #FOS: Computer and information sciences #cs.CC
paper · pdf · doi:10.48550/arxiv.cs/0307020
Preliminary Version
arxiv created 2003/07/08 · arxiv updated 2009/12/01
We show that a certain representation of the matrix-product can be computed with no(1) multiplications. We also show, that siumilar representations of matrices can be compressed enormously.