de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Lower Bounds for the Matrix Chain Ordering Problem

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44170

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
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, 2nd Latin American Symposium (pp. 112-130). Berlin: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-AC99-B
Abstract
There is no abstract available