BloomTech’s Downfall: A Long Time Coming

An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature

An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Intro

1 of 12
Next

1 of 12

Intro

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Intro
  2. 2 Adversarial version
  3. 3 Games against Nature
  4. 4 "MA" formula perspective
  5. 5 Basic ideas
  6. 6 Composition of algorithms
  7. 7 Algorithms with baseline advice
  8. 8 Composition and defect
  9. 9 "Steepener" algorithms
  10. 10 Steepener action
  11. 11 Decrements and decisiveness
  12. 12 Conclusions

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.