Vince Grolmusz  Home/Search
Context Related
| eccc.unitrier.de/ecccrepor...Paper.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: eccc.unitrier.de/pub/ecc...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show how one can use non-prime-power, composite moduli for computing representations of the product of two n \Theta n matrices using only n multiplications. (Update)
Cited by: More
Defying Dimensions Modulo 6 - Grolmusz (2003) (Correct)
Active bibliography (related documents): More All
0.5: On the Complexity of Matrix Product - Raz (2002) (Correct)
0.3: A 5/2 n²-Lower Bound for the Multiplicative Complexity of n.. - Bläser (Correct)
0.2: Computing Elementary Symmetric Polynomials with a Sub-Polynomial .. - Grolmusz (2002) (Correct)
Similar documents based on text: More All
0.2: Lower Bounds for (MOD p - MOD m) Circuits - Grolmusz, Tardos (1998) (Correct)
0.2: On Set Systems with Restricted Intersections Modulo a Composite.. - Grolmusz (1996) (Correct)
0.2: Superpolynomial Size Set-Systems with Restricted Intersections.. - Grolmusz (1999) (Correct)
BibTeX entry: (Update)
Vince Grolmusz. Near quadratic matrix multiplication modulo composites. Technical Report TR03-001, ECCC, 2003. ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2003/TR03001 /index.html. http://citeseer.ist.psu.edu/grolmusz03near.html More
@misc{ grolmusz03near,
author = "V. Grolmusz",
title = "Near quadratic matrix multiplication modulo composites",
text = "Vince Grolmusz. Near quadratic matrix multiplication modulo composites.
Technical Report TR03-001, ECCC, 2003. ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2003/TR03001
/index.html.",
year = "2003",
url = "citeseer.ist.psu.edu/grolmusz03near.html" }
Citations (may not include all citations):308 Matrix multiplication via arithmetic progressions (context) - Coppersmith, Winograd - 1990
168 Gaussian elimination is not optimal (context) - Strassen - 1969
16 Extra high speed matrix multiplication on the Cray - Bailey - 1988
11 A lower bound for matrix multiplication - Bshouty - 1989
11 Lower bounds for matrix product - Shpilka - 2001
5 the complexity of matrix product - Raz - 2002
4 lower bound for the rank of n \Theta n-matrix multiplication.. (context) - Blaser - 1999
2 Computing elementary symmetric polynomials with a subpolynom.. - Grolmusz - 2002
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC