The course aims to introduce the basic concepts and results of integer optimization with special emphasis on algorithmic problems on lattices that have proved to be important in theoretical computer science and cryptography during the past 30 years. ...
The classical distinction between polynomial time solvable and NP-hard problems is often too coarse. This course covers techniques for proving more fine-grained lower and upper bounds on complexity of computational problems. ...
This course introduces statistical field theory, and uses concepts related to phase transitions to discuss a variety of complex systems (random walks and polymers, disordered systems, combinatorial optimisation, information theory and error correcting cod ...
In this course, students practice designing digital business services. The students learn to apply the principles of technical sales while developing their own projects. Through this process, students gain insight into the co-creation of relationships betw ...
This doctoral course provides an introduction to optimal control covering fundamental theory, numerical implementation and problem formulation for applications. ...
The course aims to introduce the basic concepts and results on metric embeddings, or more precisely on approximate embeddings. This area has been under rapid development since the 90's and it has strong impact on algorithms for discrete optimization proble ...