Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Schéma d'approximation en temps polynomial

Cours associés (6)

MATH-504: Integer optimisation

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. ...

MATH-251(c): Analyse numérique

Le cours présente des méthodes numériques pour la résolution de problèmes mathématiques comme des systèmes d'équations linéaires ou non linéaires, l'approximation de fonctions, l'intégration et la dérivation, et les équations différentielles. ...

MGT-418: Convex optimization

This course introduces the theory and application of modern convex optimization from an engineering perspective. ...

EE-607: Advanced Methods for Model Identification

This course introduces the principles of model identification for non-linear dynamic systems, and provides a set of possible solution methods that are thoroughly characterized in terms of modelling assumptions and uncertainty levels. ...

MATH-616: Numerical methods for random PDEs and uncertainty

The course focuses on mathematical models based on PDEs with random parameters, and presents numerical techniques for forward uncertainty propagation, inverse uncertainty analysis in a Bayesian framework and optimal control under uncertainty. ...

MATH-683: Fine-grained and parameterized complexity

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. ...