Lectures related to Integer Factorization: Quadratic Sieve

Covers higher order methods for solving equations iteratively, including fixed point methods and Newton's method.

Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.

Explores the Extra-Gradient method for Primal-dual optimization, covering nonconvex-concave problems, convergence rates, and practical performance.

Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.

Explores primes, the Fundamental Theorem of Arithmetic, trial division, the Sieve of Eratosthenes, and Euclid's Theorem.