Very Fast Approximation of the Matrix Chain Product Problem

DOI10.1006/JAGM.1996.0037MaRDI QIDQ4895797zbMATH OpenOpenAlexFDO

Authors Artur Czumaj

Publication date 16 October 1996

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/e8b840a921f7967b30ac161b3dd9654b27998ddb

zbMATH Keywords

CREW PRAMmatrix chain product problem

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• An optimal parallel algorithm for computing a near-optimal order of matrix multiplications
• scientific article; zbMATH DE number 512836
• Efficient Matrix Chain Ordering in Polylog Time

Cited in

(5)

• scientific article; zbMATH DE number 512836 (Why is no real title available?)
• Efficient Matrix Chain Ordering in Polylog Time
• scientific article; zbMATH DE number 1501237 (Why is no real title available?)
• An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem
• An approximation algorithm for the matrix tree multiplication problem

This page was built for publication: Very Fast Approximation of the Matrix Chain Product Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895797)