Sciweavers

IPPS
1999
IEEE
13 years 9 months ago
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....
Keqin Li, Victor Y. Pan