Hardness of Approximation Between P and NP

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

Lecture on hardness of approximation between complexity classes P and NP. Teaches theoretical computer science foundations of computational complexity.

A 50-minute video from Microsoft Research: “Hardness of Approximation Between P and NP”.

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