Solving Parity Games in PracticeExplores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Open ProblemsExplores a variety of open problems in graph theory and computational complexity, challenging students to analyze and solve complex issues.
Prim's and Kruskal's AlgorithmsExplores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
Elements of Computational ComplexityIntroduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.
Knowledge Inference for GraphsExplores knowledge inference for graphs, discussing label propagation, optimization objectives, and probabilistic behavior.
Information Theory: BasicsCovers the basics of information theory, entropy, and fixed points in graph colorings and the Ising model.
Complexity Classes: P and NPExplores complexity classes P and NP, highlighting solvable and verifiable problems, including NP-complete challenges.
