Concept
Greek alphabet
Related courses (31)
MICRO-435: Quantum and nanocomputing
The course teaches non von-Neumann architectures. The first part of the course deals with quantum computing, sensing, and communications. The second focuses on field-coupled and conduction-based nanoc
PHYS-642: Statistical physics for optimization & learning
This course covers the statistical physics approach to computer science problems, with an emphasis on heuristic & rigorous mathematical technics, ranging from graph theory and constraint satisfaction
PHYS-401: Astrophysics IV : stellar and galactic dynamics
The aim of this course is to acquire the basic knowledge on specific dynamical phenomena related to the origin, equilibrium, and evolution of star
clusters, galaxies, and galaxy clusters.
CS-119(c): Information, Computation, Communication
L'objectif de ce cours est d'introduire les étudiants à la pensée algorithmique, de les familiariser avec les fondamentaux de l'Informatique et de développer une première compétence en programmation (
PHYS-739: Conformal Field theory and Gravity
This course is an introduction to holography, the modern approach to quantum gravity.
PHYS-427: Relativity and cosmology I
Introduce the students to general relativity and its classical tests.
ME-332: Mechanical vibrations
Dans ce cours on étudie la dynamique modale des structures mécaniques. Conceptes clés comme Mode Normale, Mass et Raideur effective, et Fréquences Propres sont appris pendant ce cours.
ME-331: Solid mechanics
Model the behavior of elastic, viscoelastic, and inelastic solids both in the infinitesimal and finite-deformation regimes.
CS-320: Computer language processing
We teach the fundamental aspects of analyzing and interpreting computer languages, including the techniques to build compilers. You will build a working compiler from an elegant functional language in
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