Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation
Why it's on BrighterTube
Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidenceRandomized fixed-point computation bounds teach algorithm analysis and complexity of iterative solutions. Theoretical computer science and randomized algorithms.
What you'll learn
A 63-minute video from Microsoft Research: “Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation”.
Video by Microsoft Research, played through YouTube's embedded player.