Spin Model Exercises

Related lectures (18)

Page 1 of 2

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Explores the computation of mean field and effective field in message passing algorithms.

Explores the optimality of the greedy change-making algorithm and the stability of maximum matching.

Explores bipartite graphs, independent sets, Shearer's Lemma, labeled graphs, and entropy analysis.

Explores the Ford-Fulkerson method for maximal flow and disjoint-set data structures.

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.

Covers the concept of stable matchings and the Gale-Shapley algorithm.

Introduces hypergraphs, generalizing graphs by allowing subsets of nodes to form edges and exploring their applications in various fields.

Covers the concept of stable matchings and the Gale-Shapley algorithm.

Explores linear programming duality, covering constraints, variables, solutions, and the relationship between primal and dual LP.