Skip to content

Satisfiability of Ordering CSPs Above Average Is Fixed-Parameter Tractable

About this video

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

Addresses computational complexity of constraint satisfaction problems. Specialized theoretical result with direct technical title.

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