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
Matrix Multiplication and Heap Data Structure
Graph Chatbot
Related lectures (30)
Previous
Page 1 of 3
Next
Matrix Multiplication and Divide-and-Conquer Techniques
Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.
Matrix Multiplication and Heaps: Efficient Algorithms
Discusses Strassen's algorithm for matrix multiplication and heaps, covering efficient algorithms and their applications 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.
Heaps and Priority Queues
Explores heaps, heapsort, and priority queues, including operations and analysis.
Heaps: Data Structure and Heapsort
Explores heaps, heapsort, and their efficiency in implementing priority queues.
Matrix-Matrix Multiplication: Algorithms and Applications
Explores theoretical and practical aspects of fast matrix-matrix multiplication algorithms and their significance in computer science.
Heaps and Heapsort
Covers heaps, heapsort, heap data structure, storage in arrays, and heap property maintenance.
Matrix Multiplication: Divide-and-Conquer
Explores the Divide-and-Conquer algorithm for matrix multiplication, including Strassen's Method and its significance in optimizing time complexity.
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.
