Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Dynamic Programming: Longest Common Subsequence
Graph Chatbot
Related lectures (28)
Previous
Page 2 of 3
Next
Matrix Chain Multiplication
Explores matrix chain multiplication to minimize scalar multiplications efficiently.
Diagonalizability of Matrices
Covers the concept of diagonalizability of matrices and explores eigenvalues and eigenvectors.
Matrix Operations: Definitions and Properties
Covers the definitions and properties of matrices, including matrix operations and determinants.
Cyclic Subspace Decomposition
Explores minimal annihilating polynomials and cyclic invariant subspaces, showcasing their practical applications through matrix computations.
Matrix-Matrix Multiplication: Algorithms and Applications
Explores theoretical and practical aspects of fast matrix-matrix multiplication algorithms and their significance in computer science.
Matrix Multiplication: Strassen's Algorithm
Introduces matrix multiplication and Strassen's algorithm, covering divide-and-conquer approach, data structures like heaps, and MAX-HEAPIFY operation.
Matrix Multiplication
Covers matrix multiplication, properties, and the identity matrix in algebraic operations.
Matrix Multiplication: Algorithms and Complexity
Covers matrix notation, arithmetic, multiplication algorithms, and complexity analysis.
Recursion Trees and Matrix Multiplication
Covers recursion trees, the maximum subarray problem, and matrix multiplication approaches.
Matrix Operations: Partitions and Blocks
Covers matrix operations, including partitioning and block multiplication.
