Session 8B - Smoothed Complexity of Local Max-Cut and Binary Max-CSP

About this video

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

Analyzes smoothed complexity of local max-cut and binary max-CSP problems. Teaches smoothed analysis and its application to hard optimization problems.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of STOC 2020