Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Matrix chain multiplication is an optimization problem that can be solved using dynamic programming. Given a sequence of matrices, we want to find the most efficient way to multiply these matrices together. The problem is not actually to perform the multiplications, but merely to decide in which order to perform the multiplications. We have many options because matrix multiplication is associative. In other words, no matter how we parenthesize the product, the result will be the same.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.