Lectures related to LLL Algorithm

Covers Coppersmith's method for attacking RSA encryption by efficiently finding small roots of polynomials modulo N.

Introduces logic, proofs, sets, functions, and algorithms in mathematics and computer science.

Explores the Tower of Hanoi algorithm, recursion, and dynamic programming in solving problems efficiently.

Explores orthogonality, norms, and distances in vector spaces for solving linear systems.

Explores the integrality gap concept in set cover and multiplicative weights algorithms.

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Explores mapping functions, surjections, injective and surjective functions, and bijective functions.

Continues the discussion on Simon's hidden subgroup problem, focusing on finding a basis.