Session 1C - A polynomial lower bound on adaptive complexity of submodular maximization
479 views
About this video
Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by videoEstablishes polynomial lower bound on adaptive complexity of submodular maximization. Teaching complexity analysis for sequential decision-making in optimization.
Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.
Part of STOC 2020