Concept
Contradiction
Cours associés (32)
MATH-301: Ordinary differential equations
Ce cours donne une introduction rigoureuse au principaux thèmes de la théorie des équations différentielles ordinaires (EDO). Les EDO sont fondamentales pour l'étude des systèmes dynamiques et des équ
MATH-101(en): Analysis I (English)
We study the fundamental concepts of analysis, calculus and the integral of real-valued functions of a real variable.
CS-450: Algorithms II
A first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a reper
MATH-310: Algebra
This is an introduction to modern algebra: groups, rings and fields.
COM-516: Markov chains and algorithmic applications
The study of random walks finds many applications in computer science and communications. The goal of the course is to get familiar with the theory of random walks, and to get an overview of some appl
MATH-476: Optimal transport
The first part is devoted to Monge and Kantorovitch problems, discussing the existence and the properties of the optimal plan. The second part introduces the Wasserstein distance on measures and devel
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 applic
MATH-201: Analysis III
Calcul différentiel et intégral.
Eléments d'analyse complexe.
MATH-512: Optimization on manifolds
We develop, analyze and implement numerical algorithms to solve optimization problems of the form min f(x) where x is a point on a smooth manifold. To this end, we first study differential and Riemann
CS-550: Formal verification
We introduce formal verification as an approach for developing highly reliable systems. Formal verification finds proofs that computer systems work under all relevant scenarios. We will learn how to u