Lower Bounds for the Matrix Chain Ordering Problem

Bradford, Phillip Gnassi; Choppela, Venkatesh; Rawlins, Gregory J.E.

doi:10.1007/3-540-59175-3_85

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Lower Bounds for the Matrix Chain Ordering Problem

MPS-Authors

/persons/resource/persons44170

Bradford, Phillip Gnassi
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dt5Ua
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bradford, P. G., Choppela, V., & Rawlins, G. J. (1995). Lower Bounds for the Matrix Chain Ordering Problem. In R. Baeza-Yates, E. Goles, & P. V. Poblete (Eds.), LATIN '95: Theoretical Informatics (pp. 112-130). Berlin: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AC99-B

Abstract

There is no abstract available