249 search results - page 5 / 50 » Geometry and the complexity of matrix multiplication |
COCO
2005
Springer
14 years 1 months ago
2005
Springer
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
This paper explains why parallel implementation of matrix multiplication--a seemingly simple algorithm that can be expressed as one statement and three nested loops--is complex: P...
IPPS
1999
IEEE
14 years 20 hour ago
1999
IEEE
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....
KELSI
2004
Springer
14 years 1 months ago
2004
Springer
Multiple sequence alignment (MSA) is a vital problem in biology. Optimal alignment of multiple sequences becomes impractical even for a modest number of sequences [1] since the gen...
ICS
2007
Tsinghua U.
14 years 1 months ago
2007
Tsinghua U.
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...