Skip to content

Session 10C - A Lower Bound for Parallel Submodular Minimization

450 views

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video

Proves lower bound on parallel submodular minimization. Teaching complexity results and hardness techniques for combinatorial optimization problems.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of STOC 2020