Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,597,900 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.
2018
2018
La multiplication du nombre e groupes parlementaires: pluralisme ou balkanisationde la représentation nationale?
G. Bergougnous
2018
Corpus ID: 128115854
2013
2013
Accelerated Dynamic Programming on GPU: A Study of Speed Up and Programming Approach
Mohsin Altaf Wani
,
S. Quadri
2013
Corpus ID: 720309
Graphics processing units) can be used for general purpose parallel computation. Developers can develop parallel programs running…
Expand
2013
2013
A New Approach to Communicate Secret Message (Key) Among a Group Using Chain Matrix Multiplication Based on Public Key Crypto System
N. Eluri
,
K. V. Rao
,
M. S. Rao
,
M. Bazeed
2013
Corpus ID: 58169123
Group key management is a fundamental building block for secure group communication systems. It is required for many applications…
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
2008
2008
Task Parallel Skeletons for Divide and Conquer
Michael Poldner
,
H. Kuchen
2008
Corpus ID: 17123710
Algorithmic skeletons intend to simplify parallel programming by providing recurring forms of program structure as predefined…
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
2003
2003
Analysis of Algorithm and Time Complexity on the Optimum Order of Matrix Chain Multiplication
Liang Wu
2003
Corpus ID: 123853444
After describing the optimum order o f matrix chain multiplication probl em,this paper analyses the optimum solution structure of…
Expand
1993
1993
Matrix Chain Ordering in Polylog Time with n = lgn
ProcessorsPhillip
,
G. Bradford
,
E. GregoryJ.
,
Rawlinsy
,
E. Gregory
,
ShannonzFebruary
1993
Corpus ID: 14309706
This paper gives a O(lg 4 n) time and n=lg n processor algorithm for solving the matrix chain ordering problem and for nding…
Expand