Covers the concept of hedging for Linear Programs and the simplex method, focusing on minimizing costs and finding optimal solutions.
Covers the Simplex algorithm for function minimization with linear constraints.
Covers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.
Explores linear programming duality, covering constraints, variables, solutions, and the relationship between primal and dual LP.
Covers concentration inequalities and sampling methods for estimating unknown distributions, with a focus on population infection rates.
Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Covers streaming algorithms, power of two choices, Misra-Gries estimator, and AMS sketch for frequency estimation.
Covers the Hedge algorithm for minimizing loss in linear programming problems.
