Lecture
Optimization Problem: Feasible Region Analysis
Related lectures (63)
Shortest Path in Directed Graphs
Covers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.
Simplex Algorithm: Basics
Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.
Linear Algebra: Efficiency and Complexity
Explores constraints, efficiency, and complexity in linear algebra, emphasizing convexity and worst-case complexity in algorithm analysis.
Hertz Theory: Real Area of Contact
Explores Hertz theory for contact problems and the Tabor measurement method.
Pseudorandomness: Theory and Applications
Explores pseudorandomness theory, AI challenges, pseudo-random graphs, random walks, and matrix properties.
Poisson Paradigm: Qualitative / Quantitative
Covers the Poisson Paradigm, including the First/Second Moment Method and Martingales, discussing dependency graphs and Chernoff bounds.
Martingales: More Theory
Explores the theory of martingales, including conditional expectations, Chernoff bounds, and Azuma's inequality.
Interlacing Polynomials
Explores interlacing polynomials, real rooted theorems, and pseudo-probabilistic methods in polynomial analysis.
Analytical Geometry: Cartesian Equations
Covers Cartesian equations in analytical geometry, focusing on encoding line directions and unique equations.
Probability and Statistics
Covers topics related to probability and statistics, including finding specific values and significant events.