NP-Hard: Subset Sum & Independent Set Reduction
Explores algorithms for NP-hard problems, focusing on reducing the Independent Set problem to Subset Sum. π
Tim Roughgarden Lectures
4.0K views β’ May 20, 2020
About this video
Reduction from the Independent Set problem to the Subset Sum problem.
Accompanies the book Algorithms Illuminated, Part 4: Algorithms for NP-Hard Problems (http://www.algorithmsilluminated.org/)
Full playlist: https://www.youtube.com/playlist?list=PLEGCF-WLh2RK6lq3iSsiU84rWVee3A-hz
Accompanies the book Algorithms Illuminated, Part 4: Algorithms for NP-Hard Problems (http://www.algorithmsilluminated.org/)
Full playlist: https://www.youtube.com/playlist?list=PLEGCF-WLh2RK6lq3iSsiU84rWVee3A-hz
Video Information
Views
4.0K
Likes
40
Duration
26:25
Published
May 20, 2020
User Reviews
4.3
(4) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.