Name
Abstract | ||
|---|---|---|
A generalization of recent group-theoretic matrix multiplication al- gorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added exibility of this approach can in some cases improve upper bounds on the exponent of matrix multipli- cation yielded by group-theoretic full matrix multiplication. The group theory behind our partial matrix multiplication algorithms leads to the problem of maximizing a quantity representing the \fullness" of a given partial matrix pattern. This problem is shown to be NP-hard, and two algorithms, one optimal and another non-optimal but polynomial-time, are given for solving it. |
Year | Venue | Keywords |
|---|---|---|
2009 | Clinical Orthopaedics and Related Research | group theory,symbolic computation,polynomial time,computational complexity,upper bound,matrix multiplication |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Multiplication algorithm,Single-entry matrix,Matrix chain multiplication,Matrix multiplication,Diagonal matrix,Mathematics,Block matrix,Involutory matrix,DFT matrix | Journal | abs/0902.2 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richard Strong Bowen | 1 | 0 | 0.34 |
| Bo Chen | 2 | 0 | 0.34 |
| Hendrik Orem | 3 | 0 | 0.34 |
| Martijn Van Schaardenburg | 4 | 0 | 0.34 |