A Tutorial on the Likely Worst-Case Complexities of NP-Complete Problems - Russell Impagliazzo

About this video

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

A tutorial surveying worst-case complexity bounds for NP-complete problems, covering approximation and probabilistic methods. Teaches fundamental theoretical computer science concepts and proof techniques.

A 116-minute video from Institute for Advanced Study: “A Tutorial on the Likely Worst-Case Complexities of NP-Complete Problems - Russell Impagliazzo”.

Video by Institute for Advanced Study, played through YouTube's embedded player.