ON THE ASYMPTOTIC COMPLEXITY OF RECTANGULAR MATRIX MULTIPLICATION

被引：21

作者：

LOTTI, G ^{[1
]}

ROMANI, F ^{[1
]}

机构：

[1] CNR,IST ELABORAZ INFORMAZ,I-56100 PISA,ITALY

来源：

THEORETICAL COMPUTER SCIENCE | 1983年 / 23卷 / 02期

关键词：

D O I：

10.1016/0304-3975(83)90054-3

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：171 / 185

页数：15

共 10 条

[1] APPROXIMATE SOLUTIONS FOR THE BILINEAR FORM COMPUTATIONAL PROBLEM [J].

BINI, D ;

LOTTI, G ;

ROMANI, F .

SIAM JOURNAL ON COMPUTING, 1980, 9 (04) :692-697

[2]

Bini D., 1980, Calcolo, V17, P87, DOI 10.1007/BF02575865

[3] O(N2.7799) COMPLEXITY FOR N BY N APPROXIMATE MATRIX MULTIPLICATION [J].

BINI, D ;

CAPOVANI, M ;

ROMANI, F ;

LOTTI, G .

INFORMATION PROCESSING LETTERS, 1979, 8 (05) :234-235

[4]

Brockett R. W., 1976, SIAM Journal on Computing, V5, P624, DOI 10.1137/0205041

[5]

COPPERSMITH D, UNPUB SIAM J COMPUT

[6] NEW FAST ALGORITHMS FOR MATRIX OPERATIONS [J].

PAN, VY .

SIAM JOURNAL ON COMPUTING, 1980, 9 (02) :321-342

[7] NEW COMBINATIONS OF METHODS FOR THE ACCELERATION OF MATRIX MULTIPLICATION [J].

PAN, VY .

COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1981, 7 (01) :73-125

[8] SOME PROPERTIES OF DISJOINT SUMS OF TENSORS RELATED TO MATRIX MULTIPLICATION [J].

ROMANI, F .

SIAM JOURNAL ON COMPUTING, 1982, 11 (02) :263-267

[9] PARTIAL AND TOTAL MATRIX MULTIPLICATION [J].

SCHONHAGE, A .

SIAM JOURNAL ON COMPUTING, 1981, 10 (03) :434-455

[10] GAUSSIAN ELIMINATION IS NOT OPTIMAL [J].

STRASSEN, V .

NUMERISCHE MATHEMATIK, 1969, 13 (04) :354-&

← 1 →