Computer Science – Computational Complexity
Scientific paper
2003-01-08
Computer Science
Computational Complexity
Prelimanary version, 6 pages
Scientific paper
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.
No associations
LandOfFree
Near Quadratic Matrix Multiplication Modulo Composites does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Near Quadratic Matrix Multiplication Modulo Composites, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Near Quadratic Matrix Multiplication Modulo Composites will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-96827