Skip to content

Solving Max-SAT by Decoupling Optimization and Satisfaction

About this video

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

Covers MAX-SAT solving through decoupling optimization and satisfaction constraints. Teaches algorithm design for NP-hard satisfiability problems.

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