Explain Strassen's Matrix Multiplication.
Updated Apr 28, 2026
Short answer
A divide and conquer algorithm that reduces matrix multiplication from O(n^3) to O(n^2.807).
Deep explanation
Medium-level D&C explores specific mathematical optimizations and trade-offs. A divide and conquer algorithm that reduces matrix multiplication from O(n^3) to O(n^2.807).
Real-world example
Efficiently multiplying very large numbers in cryptographic systems.
Common mistakes
- Applying Master Theorem to recurrences that don't fit the standard format.
Follow-up questions
- What happens if a < 1?