Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > FAST MATRIX MULTIPLICATION:
Reports tagged with fast matrix multiplication:
TR03-001 | 8th January 2003
Vince Grolmusz

#### Near Quadratic Matrix Multiplication Modulo Composites

We show how one can use non-prime-power, composite moduli for
computing representations of the product of two $n\times n$ matrices
using only $n^{2+o(1)}$ multiplications.

more >>>

TR03-058 | 22nd July 2003
Vince Grolmusz

#### Defying Dimensions Modulo 6

Revisions: 2

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.

more >>>

ISSN 1433-8092 | Imprint