Algorithms for NP-Hard Problems (Section 22.5: Directed Hamiltonian Path Is NP-Hard)
Reduction from the 3-SAT problem to the Directed Hamiltonian Path problem. Accompanies the book Algorithms Illuminated, Part 4: Algorithms for NP-Hard Proble...
Tim Roughgarden Lectures
4.2K views • May 20, 2020
About this video
Reduction from the 3-SAT problem to the Directed Hamiltonian Path 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.2K
Likes
46
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.