Lecture
Pseudorandomness: Theory and Applications
Related lectures (122)
Polynomial Averaging: Root Pairing
Delves into the concept of averaging polynomials and the significance of pairing up roots.
Percolation Theory: FKG Inequality
Explores the FKG inequality in percolation theory and the reverse FKG theorem.
Hertz Theory: Real Area of Contact
Explores Hertz theory for contact problems and the Tabor measurement method.
Solving Linear Programs: SIMPLEX Method
Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.
Reformulating Problems: Tools and Intuition
Focuses on open problems and the importance of reformulating problems with better tools and intuition.
Ramanujan Graphs: Constructions and Similarities
Explores Ramanujan graphs' constructions, matching polynomials, perfect matchings, and universal covers, along with quantitation and qualitative aspects.
Max-Flow Min-Cut
Explores the Ford Fulkerson algorithm, Max-Flow Min-Cut theorem, Incidence matrix, and network optimization complexity.
Interlacing Polynomials
Explores interlacing polynomials, real rooted theorems, and pseudo-probabilistic methods in polynomial analysis.
Thermodynamics: Exams and Transformations
Covers thermodynamic concepts and exam questions from 2012, 2013, and 2015.
Shortest Path in Directed Graphs
Covers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.