๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Very Fast Approximation of the Matrix Chain Product Problem

โœ Scribed by Artur Czumaj


Book ID
102578194
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
126 KB
Volume
21
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

โœฆ Synopsis


This paper considers the matrix chain product problem. This problem can be ลฝ . solved in O n log n sequential time, while the best known parallel NC algorithm ลฝ 2 .

6 6 ' ลฝ . algorithm produces solutions for the above problems that are at most 1r 2 3 q 3 ลฝ . f0.1547 times the optimal solutions.


๐Ÿ“œ SIMILAR VOLUMES