Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem

From MaRDI portal
Publication:4895834
Jump to:navigation, search

DOI10.1137/0225039zbMath0857.68043OpenAlexW1998174380MaRDI QIDQ4895834

Prakash V. Ramanan

Publication date: 3 March 1997

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0225039


zbMATH Keywords

parallel random-access machinedynamic-programming algorithmsmatrix-chain product


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)


Related Items (1)

Revisiting “Computation of Matrix Chain Products




This page was built for publication: An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4895834&oldid=19277246"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 06:38.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki