Lecture - 27 NP - Compliteness - II
About this video
Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by videoThis lecture explains NP-completeness theory, a fundamental computer science concept. It teaches how to classify problems by computational difficulty.
Video by nptelhrd, played through YouTube's embedded player.