Covers the concepts of limits and colimits in the category of Topological Spaces, emphasizing the relationship between colimit and limit constructions and adjunctions.
Explores the convexity of Lovász extension and submodular function maximization, focusing on extending functions to convex sets and proving their convexity.
Explores the concept of duality in linear programming and its practical implications in optimization.
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.