Lectures related to Graph Isomorphisms

Explores algorithmic complexity, comparing growth rates using Theta notation and characterizing different complexity classes.

Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.

Covers the basics of algorithms, problem-solving, and efficient resolution methods.

Introduces hypergraphs, generalizing graphs by allowing subsets of nodes to form edges and exploring their applications in various fields.

Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.