Solving Parity Games in PracticeExplores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Approximation AlgorithmsCovers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Dynamic Programming: KnapsackExplores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.
Optimization AlgorithmsCovers optimization algorithms, convergence properties, and time complexity of sequences and functions.