Computer Science – Computational Complexity
Scientific paper
2003-07-08
Computer Science
Computational Complexity
Preliminary Version
Scientific paper
We show that a certain representation of the matrix-product can be computed
with $n^{o(1)}$ multiplications. We also show, that siumilar representations of
matrices can be compressed enormously.
No associations
LandOfFree
Defying Dimensions Mod 6 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 Defying Dimensions Mod 6, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Defying Dimensions Mod 6 will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-10309