Lectures related to Problem-solving Strategies: Sum of Integers (Recursive) Complexity

Factoring Polynomials: Complexity and Algorithms

Delves into the complexity of factoring polynomials and the implications for security.

Stream Ciphers: Buteforce Inversion Algorithms

Explores stream ciphers, buteforce inversion algorithms, key recovery games, and attacks in cryptography.

Dynamic Programming: Solving Sequential Problems Efficiently

Explores dynamic programming for efficient problem-solving, illustrated with binomial coefficients and Pascal's triangle.

The Quantum Fourier Transform

Covers the Quantum Fourier Transform and its application in quantum computing, explaining the process of input values computation and the concept of complex numbers.

Low Complexity MIMO ML Receivers

Explores MIMO spatial multiplexing, ML detection, receivers with fading, tree representation, and sphere decoding.