Skip to content

Lecture - 28 NP-Completeness - III

nptelhrd2.25M subscribers

About this video

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

This lecture addresses NP-completeness and its theoretical implications. It teaches computational complexity concepts.

Video by nptelhrd, played through YouTube's embedded player.

Part of Computer - Design and Analysis of Algorithms