scientific article; zbMATH DE number 1501237

MaRDI QIDQ4500085zbMATH OpenFDO

Authors Xianghua Liu, Bicheng Yan

Publication date 4 September 2000

zbMATH Keywords

complexityapproximate algorithmmatrix link multiplication

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Computation of Matrix Chain Products. Part II
• An optimal algorithm for matrix multiplication
• Very Fast Approximation of the Matrix Chain Product Problem
• An optimal parallel algorithm for computing a near-optimal order of matrix multiplications
• An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem

Cited in

(3)

• Computation of Matrix Chain Products. Part II
• An approximation algorithm for the matrix tree multiplication problem
• Sequential optimization of matrix chain multiplication relative to different cost functions

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 Q4500085)