Skip to content

The Matching Problem in General Graphs is in Quasi-NC

About this video

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

The matching problem in general graphs demonstrates complexity-theoretic results in parallel computation. This teaches fundamental algorithmic theory.

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