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

Concept

Hauteur d'un triangle

Cours associés (7)

MATH-410: Riemann surfaces

This course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex domains under discontinuous group actions, as algebraic ...

CS-457: Geometric computing

This course will cover mathematical concepts and efficient numerical methods for geometric computing. We will explore the beauty of geometry and develop algorithms to simulate and optimize 2D and 3D geometric models with an emphasis towards computational d ...

CH-353: Introduction to electronic structure methods

Repetition of the basic concepts of quantum mechanics and main numerical algorithms used for practical implementions. Basic principles of electronic structure methods:Hartree-Fock, many body perturbation theory, configuration interaction, coupled-cluster t ...

MATH-189: Mathématiques

Ce cours a pour but de donner les fondements de mathématiques nécessaires à l'architecte contemporain évoluant dans une école polytechnique. ...

MATH-494: Topics in arithmetic geometry

P-adic numbers are a number theoretic analogue of the real numbers, which interpolate between arithmetics, analysis and geometry. In this course we study their basic properties and give various applications, notably we will prove rationality of the Weil Ze ...

EE-382: Machines électriques (pour GM)

L'objectif de ce cours est d'acquérir les connaissances de base liées aux machines électriques (conversion électromécanique). Le cours porte sur le circuit magnétique, le transformateur, les machines synchrones, asynchrones, à courant continu et les moteur ...

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