BrighterTube

Query Lower Bounds for Matroids via Group Representations

Microsoft Research359K subscribers

About this video

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

Query lower bounds for matroids via group representations teaches complexity theory and algebraic methods for proving algorithmic limits. The technique applies group theory to combinatorial optimization problems.

A 58-minute video from Microsoft Research: “Query Lower Bounds for Matroids via Group Representations”.

Science & MathProgramming & CS

Video by Microsoft Research, played through YouTube's embedded player.