Related lectures (48)
Graph Sketching: Connected Components
Covers graph sketching and connected components in streaming models.
Feynman Rules I: Asymptotic Statistic and Instantons
Covers the Feynman Rules, Asymptotic Statistics, Normal Ordering, and Instantons.
Linear Programming Duality
Explores linear programming duality, covering constraints, variables, solutions, and the relationship between primal and dual LP.
Open Problems
Explores a variety of open problems in graph theory and computational complexity, challenging students to analyze and solve complex issues.
Approximation Algorithms
Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Set Cover: Integrality Gap
Explores the integrality gap concept in set cover and multiplicative weights algorithms.
Local to Global Mapping in Finite Element Analysis
Discusses mapping local to global coordinates in finite element analysis and the importance of vertex numbering.
Quantum Field Theory II
Covers the Feynman Rules and contractions in Quantum Field Theory, emphasizing momentum conservation and symmetry factor in diagrams.
Renormalization: AQFT
Covers the concept of renormalization in Algebraic Quantum Field Theory.
Integer Programming Basics
Introduces the basics of integer programming, including binary integer programs and constraint strategies.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.