Linear Programming DualityExplores linear programming duality, covering constraints, variables, solutions, and the relationship between primal and dual LP.
Mean field computationExplores the computation of mean field and effective field in message passing algorithms.
Spin Model ExercisesCovers exercises on the spin model, independent set, matching, and increasing functions.
Max-flow Min-cut TheoremExplores the Max-flow Min-cut theorem, integral capacities, Ford-Fulkerson method, bipartite matching, and edge-disjoint paths.
Max-flow and Disjoint SetsExplores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.
Complexity of AlgorithmsExplores linear search, insertion sort, coin change, maximum matching, and the halting problem in algorithms.
Prim's and Kruskal's AlgorithmsExplores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
