Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR03-001 | 8th January 2003 00:00

Near Quadratic Matrix Multiplication Modulo Composites

RSS-Feed




TR03-001
Authors: Vince Grolmusz
Publication: 14th January 2003 16:11
Downloads: 1359
Keywords: 


Abstract:

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.


Comment(s):

Comment #1 to TR03-001 | 29th August 2003 08:32

Further improvements on the matrix-product result Comment on: TR03-001





Comment #1
Authors: Vince Grolmusz
Accepted on: 29th August 2003 08:32
Downloads: 759
Keywords: 


Abstract:

In ECCC report TR03-058
(http://www.eccc.uni-trier.de/eccc-reports/2003/TR03-058/index.html)
we strongly improved the results of this report.




ISSN 1433-8092 | Imprint