A Second Course in Algorithms (Lecture 10: The Minimax Theorem & Algorithms for Linear Programming)

The minimax theorem for two-player zero-sum games. Survey of algorithms for linear programming: the simplex method, the ellipsoid method, and interior point methods.

[Stochine]

You are honestly a phenomenal professor. I have been going through this course, and the lectures combined with the notes have helped so much.

[euclidofalexandria]

16:09 secs, duality theory, so novelty and scaling lengths, because what IS TRULY NOVEL, MUST BE REPEATED, and biased for, at varous scaling lengths, but choice is a stop gap, the ability to choose makes for logic space, like a waveguide.

[euclidofalexandria]

4:47, but wait, what if theres a hidden bias, think calling card/dice before they are played... so this affects the outcomes.

[euclidofalexandria]

41:21 secs see Klee irwin.
quantum gravity research.