COMPUTATION OF MATRIX CHAIN PRODUCTS .1.

被引：48
作者：
HU, TC
SHING, MT
机构：
来源：
SIAM JOURNAL ON COMPUTING | 1982年 / 11卷 / 02期
关键词：
D O I：
10.1137/0211028
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：362 / 373
页数：12
相关论文
共 13 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2]  
CHANDRA AK, 1975, IBM RC5626 IBM TJ WA
[3]   O(N) ALGORITHM FOR DETERMINING A NEAR-OPTIMAL COMPUTATION ORDER OF MATRIX CHAIN PRODUCTS [J].
CHIN, FY .
COMMUNICATIONS OF THE ACM, 1978, 21 (07) :544-549
[4]  
DEIMEL LE, TR7914 N CAR STAT U
[5]  
Dirac Gabriel Andrew, 1961, ABH MATH SEM HAMBURG, V25, P71, DOI [DOI 10.1007/BF02992776, 10.1007/BF02992776]
[6]  
GARDNER M, 1976, SCI AM, P120
[7]   EFFICIENT COMPUTATION OF MATRIX CHAIN PRODUCTS [J].
GODBOLE, SS .
IEEE TRANSACTIONS ON COMPUTERS, 1973, C 22 (09) :864-866
[8]  
Hu T. C., 1980, 21st Annual Symposium on Foundations of Computer Science, P28, DOI 10.1109/SFCS.1980.39
[9]   AN O(N) ALGORITHM TO FIND A NEAR-OPTIMUM PARTITION OF A CONVEX POLYGON [J].
HU, TC ;
SHING, MT .
JOURNAL OF ALGORITHMS, 1981, 2 (02) :122-138
[10]  
HU TC, 1981, 1981 P ARM NUM AN CO, P615
12