Mutual recursion

Formal sciences
Theoretical computer science
Programming language theory
High-level programming lang...

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (17)

Page 2 of 2

Recursion Trees and Matrix Multiplication

Covers recursion trees, the maximum subarray problem, and matrix multiplication approaches.

Matrix Multiplication: Divide-and-Conquer

Covers divide-and-conquer in matrix multiplication, recursion trees, the master method, maximum-subarray problem, and smart algorithm.

Dynamic Programming: Binomial Coefficients

Explores dynamic programming through binomial coefficients calculation, emphasizing efficiency and memoization in problem-solving.

Problem-solving Strategies 2: Recursion

Explores problem-solving strategies like recursion and divide and conquer methods, with examples such as the Towers of Hanoi.

Understanding Chaos in Quantum Field Theories

Explores chaos in quantum field theories, focusing on conformal symmetry, OPE coefficients, and random matrix universality.

Matrix Multiplication and Divide-and-Conquer Techniques

Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.

Merge Sort: Divide-and-Conquer

Introduces Merge Sort, a divide-and-conquer algorithm for efficient array sorting, discussing correctness, runtime analysis, linear-time merging, and recurrence solving techniques.