An optimal parallel algorithm for computing a near-optimal order of matrix multiplications

DOI10.1007/3-540-55706-7_6zbMath1502.68356OpenAlexW1537219300MaRDI QIDQ5056129

Artur Czumaj

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55706-7_6

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Approximation algorithms (68W25)

Related Items (1)

Lower bounds for the matrix chain ordering problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On efficient parallel computations for some dynamic programming problems
• Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
• Almost fully-parallel parentheses matching
• An O(n) algorithm to find a near-optimum partition of a convex polygon
• An O(n) algorithm for determining a near-optimal computation order of matrix chain products
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values

This page was built for publication: An optimal parallel algorithm for computing a near-optimal order of matrix multiplications