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
Concept
Strassen algorithm
Formal sciences
Mathematics
Algebra
Linear algebra
Graph Chatbot
Related lectures (15)
Login to filter by course
Login to filter by course
Reset
Matrix Multiplication and Divide-and-Conquer Techniques
Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.
Matrix-Matrix Multiplication: Algorithms and Applications
Explores theoretical and practical aspects of fast matrix-matrix multiplication algorithms and their significance in computer science.
Gauss-Seidel Method
Covers the Gauss-Seidel method for solving linear systems through progressive substitution and iterative processes.
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 and Heap Data Structure
Covers the divide-and-conquer algorithm for matrix multiplication and introduces the (binary) heap data structure.
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: Divide-and-Conquer
Explores the Divide-and-Conquer algorithm for matrix multiplication, including Strassen's Method and its significance in optimizing time complexity.
Row Echelon Form: Gauss-Jordan Algorithm
Covers row echelon forms and the Gauss-Jordan algorithm for solving linear systems.
Linear Equations and Matrices
Explores linear equations, matrices, and the Gauss-Jordan algorithm for efficient system solving.
Linear Projective Groups
Explores linear projective groups, quaternions, subgroup generation, and normality.
Linear Algebra: Inverse Matrix and Systems Resolution
Covers the concept of inverse matrices and systems resolution, including the conditions for matrix invertibility and the Gauss-Jordan algorithm.
Algorithms for Big Numbers: Z_n and Orders
Covers algorithms for big numbers, Z_n, and orders in a group, explaining arithmetic operations and cryptographic concepts.
Matrix Multiplication: Algorithms and Complexity
Covers matrix notation, arithmetic, multiplication algorithms, and complexity analysis.
Matrix Multiplication: Algorithms and Complexity
Covers matrix notation, arithmetic, multiplication, algorithms, and complexity of matrix multiplication.
Quantum Trajectories: Lindblad Equation and Measurements
Covers the stochastic Schrödinger equation, Lindblad equation, and continuous measurements in quantum optics.
Previous
Page 1 of 1
Next