STOC24 2 A 5 Maximum Bipartite Matching in n^{2+o(1)} Time via a Combinatorial Algorithm
About this video
Advanced · Editorial review · 85% confidenceRound-9 hunt: picked; channel-level screens (sellers/exam/re-upload/devotional/vendor) passed; strict per-title check + final strict pass; oEmbed verified.
A 20-minute video from SIGACT EC: “STOC24 2 A 5 Maximum Bipartite Matching in n^{2+o(1)} Time via a Combinatorial Algorithm”.
Video by SIGACT EC, played through YouTube's embedded player.