This video is part of Professor Frank Stajano’s lecture course on Algorithms at the University of Cambridge.

This is one of several videos in which I offer examples of dynamic programming in action. Today’s problem is that of determining the optimal order in which to perform a chain of matrix multiplications, after realising that this order dramatically affects the number of elementary operations to be executed to compute the same result.

If you find my lectures useful, give the videos a thumbs up. Subscribe and hit the notification bell for more of the same and to encourage me to publish more videos for budding computer scientists. Leave your comments below.


Course web page:
https://www.cl.cam.ac.uk/teaching/current/Algorithms/


Course handout:
https://www.cl.cam.ac.uk/teaching/2021/Algorithms/2020-2021-stajano-algs-handout.pdf


My home page:
http://frank.stajano.com

Add comment

Your email address will not be published. Required fields are marked *

Categories

All Topics