Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Revision(s):

Revision #2 to TR03-058 | 30th April 2004 00:00

RSS-Feed




Revision #2
Authors: Vince Grolmusz
Accepted on: 30th April 2004 00:00
Downloads: 1334
Keywords: 


Abstract:


Revision #1 to TR03-058 | 17th November 2003 00:00





Revision #1
Authors: Vince Grolmusz
Accepted on: 17th November 2003 00:00
Downloads: 1374
Keywords: 


Abstract:


Paper:

TR03-058 | 22nd July 2003 00:00

Defying Dimensions Modulo 6





TR03-058
Authors: Vince Grolmusz
Publication: 11th August 2003 23:36
Downloads: 1349
Keywords: 


Abstract:

We show that a certain representation of the matrix-product can be computed with $n^{o(1)}$ multiplications. We also show, that similar representations of matrices can be compressed enormously with the help of simple linear transforms.



ISSN 1433-8092 | Imprint