Lecture
Reformulating Problems: Tools and Intuition
Related lectures (70)
Expander Graphs: Properties and Eigenvalues
Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.
Interlacing Families and Ramanujan Graphs
Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.
Interlacing Families and Ramanujan Graphs
Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.
Graph Theory and Network Flows
Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.
Building Ramanujan Graphs
Explores the construction of Ramanujan graphs using polynomials and addresses challenges with the probabilistic method.
Pseudorandomness: Theory and Applications
Explores pseudorandomness theory, AI challenges, pseudo-random graphs, random walks, and matrix properties.
Integer Program Formulation
Covers the process of formulating integer programs and improving solutions.
Integer Programming Basics
Introduces the basics of integer programming, including binary integer programs and constraint strategies.
Graph Coloring: Random vs Symmetrical
Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.
Linear Programming: Optimization and Constraints
Explores linear programming optimization with constraints, Dijkstra's algorithm, and LP formulations for finding feasible solutions.