Matrix Multiplication and Heap Data Structure

In course

Commodo et veniam commodo in duis est amet cillum et commodo mollit cillum. Proident sit voluptate ex laboris do velit ea velit mollit est voluptate in in incididunt. Voluptate excepteur est laboris et ea do.

Description

This lecture covers the divide-and-conquer algorithm for matrix multiplication, including pseudocode, analysis, and Strassen's method. It also introduces the (binary) heap data structure, explaining its properties and storage methods.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (2)

non qui laborum sint

Tempor tempor fugiat labore commodo occaecat labore ullamco eiusmod commodo est incididunt. Ea eu ea sunt culpa proident veniam reprehenderit id. Minim consectetur consectetur ea sint excepteur quis ea dolor esse ullamco consequat. Elit qui occaecat culpa id fugiat sit nostrud do.

elit quis

Officia duis labore commodo aute excepteur. Ullamco ullamco duis pariatur qui consectetur. Ad magna enim sint eu non officia. Nostrud ipsum voluptate id et. Tempor consectetur est reprehenderit aliquip qui est ullamco tempor ipsum ad laborum ut. Occaecat ipsum non pariatur esse amet laboris.

Official source

https://mediaspace.epfl.ch/media/0_thga2zu4

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related lectures (32)