Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,308 papers from all fields of science
Search
Sign In
Create Free Account
Matrix chain multiplication
Known as:
Chain matrix multiplication
, Matrix-chain multiplication
Matrix chain multiplication (or Matrix Chain Ordering Problem, MCOP) is an optimization problem that can be solved using dynamic programming. Given a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Brute-force search
Generalized distributive law
Matrix multiplication
Matrix multiplication algorithm
Expand
Broader (1)
Dynamic programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Relation chaining in binary positive-only recommender systems
Rok Gomišček
,
Tomaž Curk
Expert systems with applications
2020
Corpus ID: 213301316
2018
2018
La multiplication du nombre e groupes parlementaires: pluralisme ou balkanisationde la représentation nationale?
G. Bergougnous
2018
Corpus ID: 128115854
2017
2017
Computation of Boolean matrix chain products in 3D ReRAM
Alvaro Velasquez
,
Sumit Kumar Jha
International Symposium on Circuits and Systems
2017
Corpus ID: 19398360
Energy concerns, the infamous memory wall, and the enormous data deluge of the current big-data age have made the integration of…
Expand
2013
2013
Exploiting inter-operation parallelism for matrix chain multiplication using MapReduce
Jaeseok Myung
,
Sang-goo Lee
Journal of Supercomputing
2013
Corpus ID: 255071908
In this paper, we address the matrix chain multiplication problem, i.e., the multiplication of several matrices. Although several…
Expand
2010
2010
A Running Example : Matrix Chain Multiplication
2010
Corpus ID: 10348505
Dynamic programming algorithms for combinatorial optimization generalize the strategy we studied for design and analysis of…
Expand
2008
2008
An Algorithm of solving the minimal calculating times of matrix chain-multiplication
Xie Ji
2008
Corpus ID: 124884816
In this paper,an algorithm is provided to solve the problem of matrix chain-multiplication,which gives the minimal calculating…
Expand
2007
2007
Lecture 5: Dynamic Programming: Chain Matrix Multiplication
2007
Corpus ID: 8109475
respectively. The algorithm also uses O(mn) space. Extracting the Actual Sequence: Extracting the final LCS is done by using the…
Expand
2006
2006
Research of Dynamic Programming Technique and Its Application on the Problem of Matrix Chain-Multiplication
Ye Bin
2006
Corpus ID: 63381769
Dynamic programming technique is a sort of method of solving optimization problem.In this article,the basic idea and material…
Expand
1996
1996
Computing Programs Containing Band Linear Recurrences on Vector Supercomputers
Haigeng Wang
,
A. Nicolau
,
S. Keung
,
Kai-Yeung Siu
IEEE Trans. Parallel Distributed Syst.
1996
Corpus ID: 15999257
Many large-scale scientific and engineering computations, e.g., some of the Grand Challenge problems, spend a major portion of…
Expand
1994
1994
Scalable techniques for computing band linear recurrences on massively parallel and vector supercomputers
Haigeng Wang
,
A. Nicolau
,
S. Keung
,
Kai-Yeung Siu
Proceedings of 8th International Parallel…
1994
Corpus ID: 15208820
Presents a new scalable algorithm, called the 'regular schedule', for parallel evaluation of band linear recurrences (BLRs), i.e…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE