Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Explores finite dimensional spaces, covering extraction process, bases generation, and space completion.
Explores optimization in energy system modeling, covering decision variables, objective functions, and different strategies with their pros and cons.
Covers Coppersmith's method for attacking RSA encryption by efficiently finding small roots of polynomials modulo N.
