Skip to content
#

matrix-chain-multiplication

Here are 25 public repositories matching this topic...

Matrix chain multiplication (or Matrix Chain Ordering Problem, MCOP) is an optimization problem that can be solved using dynamic programming. Given a sequence of matrices, the goal is to find the most efficient way to multiply these matrices. The problem is not actually to perform the multiplications, but merely to decide the sequence of the mat…

  • Updated Oct 31, 2019
  • C++

Assignments from Algorithms Course like - All pairs shortest path, Common Substrings, Huffman Coding, K-nary Heaps, KMP, Line Sweep, Matrix Chain Multiplication, Maximum Flow, Quick Sort, Strongly Connected Components

  • Updated Jan 31, 2017
  • Java

📈 Welcome to the Design and Analysis of Algorithms Repository! 📚✨ Immerse yourself in a meticulously curated knowledge pool on algorithmic design and analysis. 🌐💡 Explore the intricacies of crafting efficient algorithms and navigating problem-solving strategies. 🚀🔍 Master the art of algorithmic exploration in this dynamic space! 👨‍💻🧮

  • Updated Dec 22, 2023
  • C

Improve this page

Add a description, image, and links to the matrix-chain-multiplication topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the matrix-chain-multiplication topic, visit your repo's landing page and select "manage topics."

Learn more