Concept
Problème de la clique
Cours associés (9)
MATH-602: Inference on graphs
The class covers topics related to statistical inference and algorithms on graphs: basic random graphs concepts, thresholds, subgraph containment (planted clique), connectivity, broadcasting on trees,
PHYS-512: Statistical physics of computation
The students understand tools from the statistical physics of disordered systems, and apply them to study computational and statistical problems in graph theory, discrete optimisation, inference and m
NX-599: Master project in Neuro-X
Students apply the scientific and technical knowledge they have acquired during their studies to a research case study in
an independent way.
CS-448: Sublinear algorithms for big data analysis
In this course we will define rigorous mathematical models for computing on large datasets, cover main algorithmic techniques that have been developed for sublinear (e.g. faster than linear time) data
MGT-483: Optimal decision making
This course introduces the theory and applications of optimization. We develop tools and concepts of optimization and decision analysis that enable managers in manufacturing, service operations, marke
CH-108(a): Chemistry Laboratory Work I
Familiariser l'étudiant avec le travail au laboratoire. Travailler de façon quantitative et/ou qualitative.
TP réalisés en relation avec les cours de chimie de 1ere année et complémentaires avec le c
MATH-467: Probabilistic methods in combinatorics
The 'probabilistic method' is a fundamental tool in combinatorics. The basic idea is as follows: to prove that an object (for example, graph) with certain properties exists, it suffices to prove that
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
MATH-802: Optimization, interpolation and modular forms
This summer school will explore basic concepts as well as recent developments in optimization, interpolation, and modular forms. There will be short courses as well as several standalone lectures by i