scientific article; zbMATH DE number 512836

MaRDI QIDQ4281529zbMATH OpenFDO

Authors Artur Czumaj

Publication date 10 March 1994

zbMATH Keywords

computational geometrydynamic programmingparallel algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15) Dynamic programming (90C39)

Recommendations

• An optimal parallel algorithm for computing a near-optimal order of matrix multiplications
• Efficient Matrix Chain Ordering in Polylog Time
• An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem
• Very Fast Approximation of the Matrix Chain Product Problem

Cited in

(8)

• On efficient parallel computations for some dynamic programming problems
• Intelligent computing systems with actors -- parallel dynamic programming algorithm of the polygon triangulation problem
• Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices
• Computation of Matrix Chain Products. Part II
• Efficient Matrix Chain Ordering in Polylog Time
• Very Fast Approximation of the Matrix Chain Product Problem
• An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem
• Revisiting ``Computation of matrix chain products

This page was built for publication:

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