Lecture - 29 NP-Completeness - IV
About this video
Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by videoThis lecture addresses NP-completeness theory and problem reduction. It teaches how to prove problems are computationally hard.
Video by nptelhrd, played through YouTube's embedded player.