Lectures related to Euclidean algorithm

Explores optimization with constraints using KKT conditions and interior point algorithm on two examples of quadratic programming.

Introduces algorithms as problem-solving procedures, covering complexity, correctness, and implementation in various languages.

Explains the winning strategy in Connect Four by checking for winning combinations.

Covers open balls in Euclidean spaces, their properties, and their significance in topology.

Covers the calculation of the greatest common divisor using polynomial methods and the Euclidean algorithm.

Explains the Euclidean algorithm for polynomials over a field K, illustrating its application with examples.

Covers the fundamentals of integer optimization, including integer programming, dynamic programming, and approximation algorithms.